/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:54,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:54,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:54,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:54,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:54,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:54,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:54,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:54,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:54,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:54,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:54,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:54,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:54,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:54,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:54,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:54,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:54,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:54,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:54,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:54,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:54,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:54,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:54,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:54,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:54,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:54,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:54,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:54,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:54,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:54,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:54,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:54,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:54,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:54,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:54,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:54,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:54,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:54,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:54,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:54,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:54,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:57:54,694 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:54,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:54,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:54,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:54,697 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:54,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:54,697 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:54,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:54,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:54,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:54,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:54,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:54,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:54,700 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:54,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:54,701 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:54,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:54,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:54,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:54,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:54,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:54,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:54,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:54,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:54,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:54,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:54,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:54,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:54,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:54,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:55,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:55,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:55,012 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:55,013 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:55,013 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2020-10-16 04:57:55,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04dd9f649/56203bb3fca74321817bdaebb7182477/FLAGd1483202d [2020-10-16 04:57:55,582 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:55,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2020-10-16 04:57:55,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04dd9f649/56203bb3fca74321817bdaebb7182477/FLAGd1483202d [2020-10-16 04:57:55,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04dd9f649/56203bb3fca74321817bdaebb7182477 [2020-10-16 04:57:55,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:55,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:55,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:55,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:55,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:55,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:55" (1/1) ... [2020-10-16 04:57:55,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce8eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:55, skipping insertion in model container [2020-10-16 04:57:55,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:55" (1/1) ... [2020-10-16 04:57:55,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:55,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:56,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:56,524 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:56,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:56,669 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:56,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56 WrapperNode [2020-10-16 04:57:56,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:56,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:56,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:56,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:56,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:56,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:56,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:56,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:56,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (1/1) ... [2020-10-16 04:57:56,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:56,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:56,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:56,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:56,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (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-16 04:57:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:56,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:56,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:56,863 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:57:59,813 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:59,814 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:57:59,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:59 BoogieIcfgContainer [2020-10-16 04:57:59,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:59,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:59,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:59,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:59,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:55" (1/3) ... [2020-10-16 04:57:59,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402bd0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:59, skipping insertion in model container [2020-10-16 04:57:59,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:56" (2/3) ... [2020-10-16 04:57:59,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402bd0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:59, skipping insertion in model container [2020-10-16 04:57:59,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:59" (3/3) ... [2020-10-16 04:57:59,825 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2020-10-16 04:57:59,876 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:59,884 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:57:59,885 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:59,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,918 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,918 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,918 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,919 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,923 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,924 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,929 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,930 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,935 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,943 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,944 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,951 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,962 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,963 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:59,983 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:58:00,002 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:58:00,003 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:58:00,003 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:58:00,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:58:00,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:58:00,003 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:58:00,003 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:58:00,003 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:58:00,016 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:58:00,057 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:58:00,057 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:00,061 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 04:58:00,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:58:00,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:00,070 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:58:00,073 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:00,076 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:00,076 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 04:58:00,097 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:58:00,097 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:00,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 04:58:00,100 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 04:58:00,508 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:58:00,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:00,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:00,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:00,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:00,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:00,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:00,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:00,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:00,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:00,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:00,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:00,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:00,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:00,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:00,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:00,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:00,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:00,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:00,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:00,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:00,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:00,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:00,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:00,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:01,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:01,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:01,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:01,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:01,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:01,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:01,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:01,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:01,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:01,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:01,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:01,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:01,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:01,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:01,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:02,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:02,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:02,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:02,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:02,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:02,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:02,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:02,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:02,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:02,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:58:02,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:58:02,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:58:02,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:02,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:58:02,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:02,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:02,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:02,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:02,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:02,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:02,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:02,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:02,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:02,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:03,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:03,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:03,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:03,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:03,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:03,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:03,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:03,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:03,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:58:03,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:58:03,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:58:03,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:03,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:03,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:58:03,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:58:03,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:03,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:03,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 04:58:03,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:58:03,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:03,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:03,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:58:03,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:58:03,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 04:58:03,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:04,760 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:58:04,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:58:04,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:04,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:58:04,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:58:05,677 WARN L193 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:58:06,321 WARN L193 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 04:58:06,614 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 04:58:07,263 WARN L193 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 127 [2020-10-16 04:58:07,581 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 04:58:07,902 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 04:58:08,292 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 04:58:08,641 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 04:58:08,881 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:58:08,986 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 04:58:08,991 INFO L132 LiptonReduction]: Checked pairs total: 3121 [2020-10-16 04:58:08,991 INFO L134 LiptonReduction]: Total number of compositions: 64 [2020-10-16 04:58:08,994 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8926 [2020-10-16 04:58:09,000 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2020-10-16 04:58:09,000 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:09,000 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:09,001 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 04:58:09,001 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:09,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:09,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1713594894, now seen corresponding path program 1 times [2020-10-16 04:58:09,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:09,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033563329] [2020-10-16 04:58:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:09,255 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-16 04:58:09,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033563329] [2020-10-16 04:58:09,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:09,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:09,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132534334] [2020-10-16 04:58:09,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:09,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:09,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:09,287 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2020-10-16 04:58:09,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 04:58:09,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:09,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2020-10-16 04:58:09,292 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:09,418 INFO L129 PetriNetUnfolder]: 74/156 cut-off events. [2020-10-16 04:58:09,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:58:09,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 156 events. 74/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 6 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 289. Up to 117 conditions per place. [2020-10-16 04:58:09,421 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 11 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2020-10-16 04:58:09,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 84 flow [2020-10-16 04:58:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2020-10-16 04:58:09,438 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2020-10-16 04:58:09,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2020-10-16 04:58:09,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2020-10-16 04:58:09,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:09,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2020-10-16 04:58:09,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:09,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:09,459 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:09,461 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 361 transitions. [2020-10-16 04:58:09,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 84 flow [2020-10-16 04:58:09,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:09,469 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2020-10-16 04:58:09,472 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 04:58:09,473 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:58:09,473 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2020-10-16 04:58:09,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:09,473 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:09,473 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:09,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:58:09,474 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1581845299, now seen corresponding path program 1 times [2020-10-16 04:58:09,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:09,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903534608] [2020-10-16 04:58:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:09,604 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-16 04:58:09,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903534608] [2020-10-16 04:58:09,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:09,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:09,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798981439] [2020-10-16 04:58:09,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:09,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:09,609 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2020-10-16 04:58:09,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states. [2020-10-16 04:58:09,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:09,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2020-10-16 04:58:09,610 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:09,713 INFO L129 PetriNetUnfolder]: 47/108 cut-off events. [2020-10-16 04:58:09,713 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 04:58:09,714 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 108 events. 47/108 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 382 event pairs, 11 based on Foata normal form. 3/109 useless extension candidates. Maximal degree in co-relation 202. Up to 82 conditions per place. [2020-10-16 04:58:09,715 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 10 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2020-10-16 04:58:09,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 74 flow [2020-10-16 04:58:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2020-10-16 04:58:09,719 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7939814814814815 [2020-10-16 04:58:09,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2020-10-16 04:58:09,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2020-10-16 04:58:09,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:09,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2020-10-16 04:58:09,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:09,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:09,722 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:09,723 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states and 343 transitions. [2020-10-16 04:58:09,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 74 flow [2020-10-16 04:58:09,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:09,724 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2020-10-16 04:58:09,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 04:58:09,725 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:58:09,725 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2020-10-16 04:58:09,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:09,725 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:09,725 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:09,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:58:09,726 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:09,726 INFO L82 PathProgramCache]: Analyzing trace with hash -272914155, now seen corresponding path program 1 times [2020-10-16 04:58:09,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:09,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948212961] [2020-10-16 04:58:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:09,809 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-16 04:58:09,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948212961] [2020-10-16 04:58:09,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:09,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:58:09,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822499239] [2020-10-16 04:58:09,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:58:09,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:58:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:58:09,813 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 144 [2020-10-16 04:58:09,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states. [2020-10-16 04:58:09,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:09,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 144 [2020-10-16 04:58:09,814 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:09,827 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 04:58:09,827 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 04:58:09,828 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:58:09,828 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 04:58:09,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 54 flow [2020-10-16 04:58:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:58:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:58:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2020-10-16 04:58:09,832 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8842592592592593 [2020-10-16 04:58:09,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2020-10-16 04:58:09,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2020-10-16 04:58:09,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:09,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2020-10-16 04:58:09,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:58:09,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:58:09,836 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:58:09,836 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 382 transitions. [2020-10-16 04:58:09,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 54 flow [2020-10-16 04:58:09,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:58:09,838 INFO L241 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2020-10-16 04:58:09,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2020-10-16 04:58:09,838 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2020-10-16 04:58:09,838 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2020-10-16 04:58:09,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:58:09,838 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:09,839 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:09,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:58:09,839 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:09,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1331514732, now seen corresponding path program 1 times [2020-10-16 04:58:09,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:09,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614952529] [2020-10-16 04:58:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:10,177 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-16 04:58:10,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614952529] [2020-10-16 04:58:10,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:10,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:58:10,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426367143] [2020-10-16 04:58:10,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:58:10,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:10,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:58:10,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:58:10,182 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 144 [2020-10-16 04:58:10,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand 6 states. [2020-10-16 04:58:10,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:10,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 144 [2020-10-16 04:58:10,183 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:10,328 INFO L129 PetriNetUnfolder]: 50/115 cut-off events. [2020-10-16 04:58:10,328 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-16 04:58:10,329 INFO L80 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 115 events. 50/115 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 409 event pairs, 37 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 246. Up to 83 conditions per place. [2020-10-16 04:58:10,330 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 13 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2020-10-16 04:58:10,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 104 flow [2020-10-16 04:58:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:58:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:58:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2020-10-16 04:58:10,334 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7326388888888888 [2020-10-16 04:58:10,334 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2020-10-16 04:58:10,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2020-10-16 04:58:10,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:10,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2020-10-16 04:58:10,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:58:10,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:58:10,338 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:58:10,339 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 4 states and 422 transitions. [2020-10-16 04:58:10,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 104 flow [2020-10-16 04:58:10,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 93 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:58:10,341 INFO L241 Difference]: Finished difference. Result has 29 places, 20 transitions, 65 flow [2020-10-16 04:58:10,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2020-10-16 04:58:10,341 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2020-10-16 04:58:10,341 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 65 flow [2020-10-16 04:58:10,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:58:10,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:10,342 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:10,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:58:10,342 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1586483592, now seen corresponding path program 1 times [2020-10-16 04:58:10,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:10,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069742181] [2020-10-16 04:58:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:10,470 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-16 04:58:10,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069742181] [2020-10-16 04:58:10,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:10,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:58:10,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058314461] [2020-10-16 04:58:10,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:58:10,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:10,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:58:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:58:10,473 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 04:58:10,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 65 flow. Second operand 4 states. [2020-10-16 04:58:10,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:10,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 04:58:10,474 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:10,515 INFO L129 PetriNetUnfolder]: 7/44 cut-off events. [2020-10-16 04:58:10,515 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 04:58:10,516 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 44 events. 7/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 120 event pairs, 2 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 82. Up to 18 conditions per place. [2020-10-16 04:58:10,516 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 4 selfloop transitions, 5 changer transitions 3/27 dead transitions. [2020-10-16 04:58:10,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 103 flow [2020-10-16 04:58:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:58:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:58:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2020-10-16 04:58:10,520 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8319444444444445 [2020-10-16 04:58:10,520 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2020-10-16 04:58:10,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2020-10-16 04:58:10,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:10,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2020-10-16 04:58:10,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:58:10,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:58:10,524 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:58:10,524 INFO L185 Difference]: Start difference. First operand has 29 places, 20 transitions, 65 flow. Second operand 5 states and 599 transitions. [2020-10-16 04:58:10,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 103 flow [2020-10-16 04:58:10,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:58:10,526 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 99 flow [2020-10-16 04:58:10,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2020-10-16 04:58:10,527 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2020-10-16 04:58:10,527 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 99 flow [2020-10-16 04:58:10,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:58:10,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:10,527 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:10,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:58:10,528 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:10,528 INFO L82 PathProgramCache]: Analyzing trace with hash 213637660, now seen corresponding path program 1 times [2020-10-16 04:58:10,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:10,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193030455] [2020-10-16 04:58:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:11,114 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-16 04:58:11,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193030455] [2020-10-16 04:58:11,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:11,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:11,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805166630] [2020-10-16 04:58:11,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:11,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:11,118 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 144 [2020-10-16 04:58:11,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 99 flow. Second operand 9 states. [2020-10-16 04:58:11,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:11,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 144 [2020-10-16 04:58:11,119 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:11,407 INFO L129 PetriNetUnfolder]: 33/118 cut-off events. [2020-10-16 04:58:11,408 INFO L130 PetriNetUnfolder]: For 112/146 co-relation queries the response was YES. [2020-10-16 04:58:11,410 INFO L80 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 118 events. 33/118 cut-off events. For 112/146 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 491 event pairs, 7 based on Foata normal form. 28/143 useless extension candidates. Maximal degree in co-relation 309. Up to 55 conditions per place. [2020-10-16 04:58:11,412 INFO L132 encePairwiseOnDemand]: 134/144 looper letters, 10 selfloop transitions, 15 changer transitions 4/41 dead transitions. [2020-10-16 04:58:11,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 208 flow [2020-10-16 04:58:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:58:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:58:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 789 transitions. [2020-10-16 04:58:11,415 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6848958333333334 [2020-10-16 04:58:11,416 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 789 transitions. [2020-10-16 04:58:11,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 789 transitions. [2020-10-16 04:58:11,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:11,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 789 transitions. [2020-10-16 04:58:11,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:58:11,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:58:11,421 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:58:11,421 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 99 flow. Second operand 8 states and 789 transitions. [2020-10-16 04:58:11,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 208 flow [2020-10-16 04:58:11,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:58:11,424 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 188 flow [2020-10-16 04:58:11,424 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2020-10-16 04:58:11,424 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2020-10-16 04:58:11,424 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 188 flow [2020-10-16 04:58:11,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:11,424 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:11,425 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:11,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:58:11,425 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1201870470, now seen corresponding path program 2 times [2020-10-16 04:58:11,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:11,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785730017] [2020-10-16 04:58:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:12,099 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-16 04:58:12,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785730017] [2020-10-16 04:58:12,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:12,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:12,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690834672] [2020-10-16 04:58:12,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:12,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:12,103 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 144 [2020-10-16 04:58:12,103 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 188 flow. Second operand 9 states. [2020-10-16 04:58:12,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:12,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 144 [2020-10-16 04:58:12,104 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:12,753 INFO L129 PetriNetUnfolder]: 46/166 cut-off events. [2020-10-16 04:58:12,753 INFO L130 PetriNetUnfolder]: For 299/355 co-relation queries the response was YES. [2020-10-16 04:58:12,754 INFO L80 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 166 events. 46/166 cut-off events. For 299/355 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 812 event pairs, 6 based on Foata normal form. 44/209 useless extension candidates. Maximal degree in co-relation 559. Up to 56 conditions per place. [2020-10-16 04:58:12,756 INFO L132 encePairwiseOnDemand]: 135/144 looper letters, 21 selfloop transitions, 23 changer transitions 0/56 dead transitions. [2020-10-16 04:58:12,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 386 flow [2020-10-16 04:58:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:58:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:58:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2020-10-16 04:58:12,760 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6590277777777778 [2020-10-16 04:58:12,760 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 949 transitions. [2020-10-16 04:58:12,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 949 transitions. [2020-10-16 04:58:12,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:12,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 949 transitions. [2020-10-16 04:58:12,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:58:12,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:58:12,766 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:58:12,766 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 188 flow. Second operand 10 states and 949 transitions. [2020-10-16 04:58:12,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 386 flow [2020-10-16 04:58:12,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 376 flow, removed 5 selfloop flow, removed 1 redundant places. [2020-10-16 04:58:12,771 INFO L241 Difference]: Finished difference. Result has 57 places, 49 transitions, 344 flow [2020-10-16 04:58:12,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=344, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2020-10-16 04:58:12,772 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2020-10-16 04:58:12,772 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 344 flow [2020-10-16 04:58:12,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:12,772 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:12,772 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:12,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:58:12,772 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1379510288, now seen corresponding path program 3 times [2020-10-16 04:58:12,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:12,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576001498] [2020-10-16 04:58:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:12,872 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-16 04:58:12,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576001498] [2020-10-16 04:58:12,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:12,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:58:12,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155797408] [2020-10-16 04:58:12,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:58:12,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:58:12,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:58:12,875 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 04:58:12,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 344 flow. Second operand 5 states. [2020-10-16 04:58:12,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:12,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 04:58:12,876 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:12,946 INFO L129 PetriNetUnfolder]: 20/112 cut-off events. [2020-10-16 04:58:12,946 INFO L130 PetriNetUnfolder]: For 302/417 co-relation queries the response was YES. [2020-10-16 04:58:12,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 112 events. 20/112 cut-off events. For 302/417 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 5 based on Foata normal form. 107/218 useless extension candidates. Maximal degree in co-relation 401. Up to 36 conditions per place. [2020-10-16 04:58:12,948 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 2 selfloop transitions, 8 changer transitions 2/50 dead transitions. [2020-10-16 04:58:12,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 367 flow [2020-10-16 04:58:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:58:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:58:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2020-10-16 04:58:12,953 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2020-10-16 04:58:12,953 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2020-10-16 04:58:12,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2020-10-16 04:58:12,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:12,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2020-10-16 04:58:12,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:58:12,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:58:12,960 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:58:12,961 INFO L185 Difference]: Start difference. First operand has 57 places, 49 transitions, 344 flow. Second operand 7 states and 833 transitions. [2020-10-16 04:58:12,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 367 flow [2020-10-16 04:58:12,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 316 flow, removed 15 selfloop flow, removed 6 redundant places. [2020-10-16 04:58:12,966 INFO L241 Difference]: Finished difference. Result has 60 places, 48 transitions, 311 flow [2020-10-16 04:58:12,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2020-10-16 04:58:12,967 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 33 predicate places. [2020-10-16 04:58:12,967 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 311 flow [2020-10-16 04:58:12,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:58:12,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:12,967 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:12,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:58:12,968 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:12,968 INFO L82 PathProgramCache]: Analyzing trace with hash -858151397, now seen corresponding path program 1 times [2020-10-16 04:58:12,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:12,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024757952] [2020-10-16 04:58:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:13,046 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-16 04:58:13,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024757952] [2020-10-16 04:58:13,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:13,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:58:13,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642882010] [2020-10-16 04:58:13,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:58:13,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:58:13,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:58:13,050 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144 [2020-10-16 04:58:13,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 311 flow. Second operand 4 states. [2020-10-16 04:58:13,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:13,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144 [2020-10-16 04:58:13,051 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:13,170 INFO L129 PetriNetUnfolder]: 23/135 cut-off events. [2020-10-16 04:58:13,170 INFO L130 PetriNetUnfolder]: For 420/455 co-relation queries the response was YES. [2020-10-16 04:58:13,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 135 events. 23/135 cut-off events. For 420/455 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 685 event pairs, 8 based on Foata normal form. 24/158 useless extension candidates. Maximal degree in co-relation 479. Up to 42 conditions per place. [2020-10-16 04:58:13,173 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 3 selfloop transitions, 1 changer transitions 23/48 dead transitions. [2020-10-16 04:58:13,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 317 flow [2020-10-16 04:58:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:58:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:58:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2020-10-16 04:58:13,177 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8506944444444444 [2020-10-16 04:58:13,177 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2020-10-16 04:58:13,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2020-10-16 04:58:13,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:13,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2020-10-16 04:58:13,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:58:13,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:58:13,182 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:58:13,183 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 311 flow. Second operand 4 states and 490 transitions. [2020-10-16 04:58:13,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 317 flow [2020-10-16 04:58:13,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 292 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 04:58:13,191 INFO L241 Difference]: Finished difference. Result has 58 places, 25 transitions, 145 flow [2020-10-16 04:58:13,191 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=58, PETRI_TRANSITIONS=25} [2020-10-16 04:58:13,192 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2020-10-16 04:58:13,192 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 25 transitions, 145 flow [2020-10-16 04:58:13,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:58:13,192 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:13,192 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:13,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:58:13,193 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1344572257, now seen corresponding path program 2 times [2020-10-16 04:58:13,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:13,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950561519] [2020-10-16 04:58:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:13,857 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-16 04:58:13,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950561519] [2020-10-16 04:58:13,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:13,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:13,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439851103] [2020-10-16 04:58:13,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:13,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:13,862 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 144 [2020-10-16 04:58:13,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 25 transitions, 145 flow. Second operand 9 states. [2020-10-16 04:58:13,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:13,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 144 [2020-10-16 04:58:13,864 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:14,041 INFO L129 PetriNetUnfolder]: 5/59 cut-off events. [2020-10-16 04:58:14,041 INFO L130 PetriNetUnfolder]: For 113/138 co-relation queries the response was YES. [2020-10-16 04:58:14,041 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 59 events. 5/59 cut-off events. For 113/138 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 0 based on Foata normal form. 15/73 useless extension candidates. Maximal degree in co-relation 210. Up to 15 conditions per place. [2020-10-16 04:58:14,042 INFO L132 encePairwiseOnDemand]: 137/144 looper letters, 5 selfloop transitions, 5 changer transitions 11/31 dead transitions. [2020-10-16 04:58:14,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 31 transitions, 223 flow [2020-10-16 04:58:14,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:58:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:58:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2020-10-16 04:58:14,046 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6684027777777778 [2020-10-16 04:58:14,046 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2020-10-16 04:58:14,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2020-10-16 04:58:14,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:14,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2020-10-16 04:58:14,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:58:14,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:58:14,050 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:58:14,051 INFO L185 Difference]: Start difference. First operand has 58 places, 25 transitions, 145 flow. Second operand 8 states and 770 transitions. [2020-10-16 04:58:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 31 transitions, 223 flow [2020-10-16 04:58:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 31 transitions, 190 flow, removed 10 selfloop flow, removed 11 redundant places. [2020-10-16 04:58:14,053 INFO L241 Difference]: Finished difference. Result has 48 places, 20 transitions, 106 flow [2020-10-16 04:58:14,054 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=20} [2020-10-16 04:58:14,054 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 21 predicate places. [2020-10-16 04:58:14,054 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 20 transitions, 106 flow [2020-10-16 04:58:14,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:14,054 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:14,054 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:58:14,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:58:14,055 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 160263691, now seen corresponding path program 3 times [2020-10-16 04:58:14,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:14,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472092825] [2020-10-16 04:58:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:14,496 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2020-10-16 04:58:14,634 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2020-10-16 04:58:14,809 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2020-10-16 04:58:14,932 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-10-16 04:58:15,051 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-16 04:58:15,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472092825] [2020-10-16 04:58:15,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:15,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:58:15,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062811380] [2020-10-16 04:58:15,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:58:15,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:58:15,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:58:15,057 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 144 [2020-10-16 04:58:15,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 20 transitions, 106 flow. Second operand 9 states. [2020-10-16 04:58:15,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:15,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 144 [2020-10-16 04:58:15,058 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:15,200 INFO L129 PetriNetUnfolder]: 1/23 cut-off events. [2020-10-16 04:58:15,200 INFO L130 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2020-10-16 04:58:15,200 INFO L80 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 23 events. 1/23 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 78. Up to 7 conditions per place. [2020-10-16 04:58:15,201 INFO L132 encePairwiseOnDemand]: 137/144 looper letters, 0 selfloop transitions, 0 changer transitions 19/19 dead transitions. [2020-10-16 04:58:15,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 19 transitions, 120 flow [2020-10-16 04:58:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:58:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:58:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 762 transitions. [2020-10-16 04:58:15,205 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2020-10-16 04:58:15,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 762 transitions. [2020-10-16 04:58:15,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 762 transitions. [2020-10-16 04:58:15,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:15,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 762 transitions. [2020-10-16 04:58:15,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:58:15,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:58:15,213 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:58:15,213 INFO L185 Difference]: Start difference. First operand has 48 places, 20 transitions, 106 flow. Second operand 8 states and 762 transitions. [2020-10-16 04:58:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 19 transitions, 120 flow [2020-10-16 04:58:15,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 19 transitions, 90 flow, removed 8 selfloop flow, removed 10 redundant places. [2020-10-16 04:58:15,217 INFO L241 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2020-10-16 04:58:15,217 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2020-10-16 04:58:15,218 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 04:58:15,218 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2020-10-16 04:58:15,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:15,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:58:15,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:58:15 BasicIcfg [2020-10-16 04:58:15,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:58:15,226 INFO L168 Benchmark]: Toolchain (without parser) took 19341.01 ms. Allocated memory was 251.7 MB in the beginning and 647.0 MB in the end (delta: 395.3 MB). Free memory was 206.7 MB in the beginning and 309.5 MB in the end (delta: -102.8 MB). Peak memory consumption was 292.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,227 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.77 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 206.7 MB in the beginning and 264.9 MB in the end (delta: -58.2 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.75 ms. Allocated memory is still 315.6 MB. Free memory was 264.9 MB in the beginning and 260.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,239 INFO L168 Benchmark]: Boogie Preprocessor took 46.82 ms. Allocated memory is still 315.6 MB. Free memory was 260.7 MB in the beginning and 258.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,240 INFO L168 Benchmark]: RCFGBuilder took 3027.12 ms. Allocated memory was 315.6 MB in the beginning and 371.7 MB in the end (delta: 56.1 MB). Free memory was 258.2 MB in the beginning and 159.6 MB in the end (delta: 98.6 MB). Peak memory consumption was 154.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,240 INFO L168 Benchmark]: TraceAbstraction took 15405.93 ms. Allocated memory was 371.7 MB in the beginning and 647.0 MB in the end (delta: 275.3 MB). Free memory was 159.6 MB in the beginning and 309.5 MB in the end (delta: -149.9 MB). Peak memory consumption was 125.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:15,247 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.20 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 783.77 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 206.7 MB in the beginning and 264.9 MB in the end (delta: -58.2 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.75 ms. Allocated memory is still 315.6 MB. Free memory was 264.9 MB in the beginning and 260.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.82 ms. Allocated memory is still 315.6 MB. Free memory was 260.7 MB in the beginning and 258.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3027.12 ms. Allocated memory was 315.6 MB in the beginning and 371.7 MB in the end (delta: 56.1 MB). Free memory was 258.2 MB in the beginning and 159.6 MB in the end (delta: 98.6 MB). Peak memory consumption was 154.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15405.93 ms. Allocated memory was 371.7 MB in the beginning and 647.0 MB in the end (delta: 275.3 MB). Free memory was 159.6 MB in the beginning and 309.5 MB in the end (delta: -149.9 MB). Peak memory consumption was 125.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 642 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.9s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 20 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 64 TotalNumberOfCompositions, 3121 MoverChecksTotal - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 42 SDtfs, 15 SDslu, 9 SDs, 0 SdLazy, 479 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 26786 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 correct! Received shutdown request...