/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/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:13,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:13,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:13,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:13,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:13,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:13,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:13,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:13,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:13,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:13,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:13,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:13,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:13,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:13,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:13,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:13,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:13,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:13,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:13,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:13,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:13,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:13,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:13,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:13,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:13,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:13,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:13,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:13,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:13,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:13,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:13,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:13,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:13,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:13,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:13,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:13,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:13,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:13,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:13,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:13,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:13,812 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:13,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:13,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:13,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:13,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:13,854 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:13,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:13,854 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:13,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:13,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:13,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:13,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:13,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:13,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:13,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:13,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:13,857 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:13,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:13,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:13,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:13,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:13,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:13,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:13,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:13,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:13,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:13,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:13,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:13,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:13,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:14,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:14,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:14,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:14,171 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:14,171 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:14,172 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 04:57:14,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06858496f/cf815e020d4046d3b187783ca0a7ec99/FLAG309b3563c [2020-10-16 04:57:14,756 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:14,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2020-10-16 04:57:14,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06858496f/cf815e020d4046d3b187783ca0a7ec99/FLAG309b3563c [2020-10-16 04:57:15,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06858496f/cf815e020d4046d3b187783ca0a7ec99 [2020-10-16 04:57:15,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:15,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:15,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:15,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:15,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:15,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:15" (1/1) ... [2020-10-16 04:57:15,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7e1758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:15, skipping insertion in model container [2020-10-16 04:57:15,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:15" (1/1) ... [2020-10-16 04:57:15,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:15,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:15,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:15,625 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:15,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:15,779 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:15,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:15 WrapperNode [2020-10-16 04:57:15,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:15,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:15,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:15,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:15,789 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:15" (1/1) ... [2020-10-16 04:57:15,814 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:15" (1/1) ... [2020-10-16 04:57:15,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:15,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:15,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:15,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:15,859 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:15" (1/1) ... [2020-10-16 04:57:15,859 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:15" (1/1) ... [2020-10-16 04:57:15,864 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:15" (1/1) ... [2020-10-16 04:57:15,865 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:15" (1/1) ... [2020-10-16 04:57:15,879 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:15" (1/1) ... [2020-10-16 04:57:15,884 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:15" (1/1) ... [2020-10-16 04:57:15,889 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:15" (1/1) ... [2020-10-16 04:57:15,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:15,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:15,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:15,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:15,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:15" (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:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:15,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:15,977 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:19,330 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:19,330 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:57:19,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:19 BoogieIcfgContainer [2020-10-16 04:57:19,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:19,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:19,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:19,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:19,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:15" (1/3) ... [2020-10-16 04:57:19,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1dd726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:19, skipping insertion in model container [2020-10-16 04:57:19,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:15" (2/3) ... [2020-10-16 04:57:19,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1dd726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:19, skipping insertion in model container [2020-10-16 04:57:19,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:19" (3/3) ... [2020-10-16 04:57:19,344 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2020-10-16 04:57:19,417 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:19,427 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:57:19,429 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:19,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,491 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:19,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,492 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:19,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,510 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,543 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:19,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:19,572 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:57:19,602 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:57:19,602 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:57:19,602 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:57:19,602 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:57:19,603 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:57:19,603 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:57:19,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:57:19,603 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:57:19,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:57:19,659 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:57:19,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:19,664 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 55 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:57:19,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:57:19,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:19,673 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:57:19,676 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:19,679 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:19,679 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:19,698 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:57:19,698 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:19,699 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 55 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:57:19,701 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 04:57:19,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:19,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:19,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:19,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:19,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:19,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:19,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:19,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:19,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:19,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:19,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:19,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:19,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:19,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:19,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:19,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:19,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:19,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:19,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:19,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:19,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:19,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:19,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:19,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:19,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:19,939 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:57:19,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:19,940 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:57:19,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:20,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,025 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:57:20,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,026 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:57:20,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:20,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:20,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:20,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:20,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:20,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,606 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:57:20,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,609 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:57:20,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:20,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:20,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:20,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:20,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:20,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:20,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:20,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:20,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:20,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:20,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:21,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:21,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:21,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:21,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,150 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:57:21,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,153 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:57:21,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,489 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:57:21,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:21,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:21,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:21,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,666 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:57:21,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,668 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:57:21,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:21,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:21,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:21,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:21,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:21,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:22,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:22,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:22,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 04:57:22,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:22,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:22,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,537 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:57:22,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,539 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:57:22,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:22,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:22,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:22,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:22,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,707 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:57:22,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,708 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:57:22,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:22,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:22,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:22,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:22,988 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:57:23,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:23,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:23,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:23,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:23,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:23,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:23,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:23,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:23,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:23,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:23,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:23,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:23,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:23,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:23,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:23,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:23,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:23,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:23,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,432 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:57:23,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:23,433 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:57:23,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:24,014 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:57:24,118 INFO L132 LiptonReduction]: Checked pairs total: 2967 [2020-10-16 04:57:24,119 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 04:57:24,122 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4451 [2020-10-16 04:57:24,128 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 04:57:24,128 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:24,129 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:24,130 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:57:24,130 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:57:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-16 04:57:24,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:24,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668172673] [2020-10-16 04:57:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:24,391 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:57:24,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668172673] [2020-10-16 04:57:24,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:24,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:24,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166385008] [2020-10-16 04:57:24,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:24,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:24,421 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2020-10-16 04:57:24,422 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states. [2020-10-16 04:57:24,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:24,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2020-10-16 04:57:24,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:24,548 INFO L129 PetriNetUnfolder]: 57/144 cut-off events. [2020-10-16 04:57:24,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:24,551 INFO L80 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 144 events. 57/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 603 event pairs, 6 based on Foata normal form. 16/155 useless extension candidates. Maximal degree in co-relation 248. Up to 88 conditions per place. [2020-10-16 04:57:24,553 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 12 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 04:57:24,553 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 82 flow [2020-10-16 04:57:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2020-10-16 04:57:24,576 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8232662192393736 [2020-10-16 04:57:24,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2020-10-16 04:57:24,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2020-10-16 04:57:24,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:24,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2020-10-16 04:57:24,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:24,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:24,600 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:24,602 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 368 transitions. [2020-10-16 04:57:24,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 82 flow [2020-10-16 04:57:24,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:24,606 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2020-10-16 04:57:24,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, 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=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2020-10-16 04:57:24,609 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:57:24,609 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2020-10-16 04:57:24,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:24,609 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:24,609 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:24,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:57:24,610 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:57:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-16 04:57:24,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:24,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712183052] [2020-10-16 04:57:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:24,787 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:57:24,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712183052] [2020-10-16 04:57:24,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:24,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:24,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654213132] [2020-10-16 04:57:24,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:24,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:24,792 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2020-10-16 04:57:24,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 04:57:24,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:24,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2020-10-16 04:57:24,793 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:24,860 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 04:57:24,860 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:24,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. [2020-10-16 04:57:24,861 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2020-10-16 04:57:24,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 72 flow [2020-10-16 04:57:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2020-10-16 04:57:24,864 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8134228187919463 [2020-10-16 04:57:24,864 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2020-10-16 04:57:24,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2020-10-16 04:57:24,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:24,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2020-10-16 04:57:24,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:24,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:24,869 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:24,869 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 606 transitions. [2020-10-16 04:57:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 72 flow [2020-10-16 04:57:24,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:24,871 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 52 flow [2020-10-16 04:57:24,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, 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=5, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 04:57:24,871 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 04:57:24,872 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 52 flow [2020-10-16 04:57:24,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:24,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:24,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:24,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:57:24,872 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:57:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash 324774380, now seen corresponding path program 1 times [2020-10-16 04:57:24,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:24,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353501971] [2020-10-16 04:57:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:25,040 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:57:25,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353501971] [2020-10-16 04:57:25,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:25,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:25,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362328589] [2020-10-16 04:57:25,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:25,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:25,043 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 149 [2020-10-16 04:57:25,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 52 flow. Second operand 4 states. [2020-10-16 04:57:25,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:25,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 149 [2020-10-16 04:57:25,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:25,131 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 04:57:25,132 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:57:25,132 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 23 events. 0/23 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 2/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 04:57:25,132 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 04:57:25,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 20 transitions, 70 flow [2020-10-16 04:57:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2020-10-16 04:57:25,135 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8295302013422818 [2020-10-16 04:57:25,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2020-10-16 04:57:25,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2020-10-16 04:57:25,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:25,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2020-10-16 04:57:25,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:25,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:25,139 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:25,140 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 52 flow. Second operand 5 states and 618 transitions. [2020-10-16 04:57:25,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 20 transitions, 70 flow [2020-10-16 04:57:25,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 62 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:25,141 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 56 flow [2020-10-16 04:57:25,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, 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=5, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 04:57:25,141 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 04:57:25,142 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 56 flow [2020-10-16 04:57:25,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:25,142 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:25,142 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:25,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:57:25,142 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:57:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:25,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1421855306, now seen corresponding path program 1 times [2020-10-16 04:57:25,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:25,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260659935] [2020-10-16 04:57:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:25,423 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:57:25,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260659935] [2020-10-16 04:57:25,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:25,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:25,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824506652] [2020-10-16 04:57:25,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:25,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:25,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:25,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:25,427 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2020-10-16 04:57:25,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 56 flow. Second operand 8 states. [2020-10-16 04:57:25,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:25,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2020-10-16 04:57:25,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:25,855 INFO L129 PetriNetUnfolder]: 178/336 cut-off events. [2020-10-16 04:57:25,855 INFO L130 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2020-10-16 04:57:25,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 336 events. 178/336 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1324 event pairs, 44 based on Foata normal form. 14/350 useless extension candidates. Maximal degree in co-relation 755. Up to 232 conditions per place. [2020-10-16 04:57:25,859 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 23 selfloop transitions, 13 changer transitions 9/49 dead transitions. [2020-10-16 04:57:25,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 214 flow [2020-10-16 04:57:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 671 transitions. [2020-10-16 04:57:25,863 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5629194630872483 [2020-10-16 04:57:25,863 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 671 transitions. [2020-10-16 04:57:25,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 671 transitions. [2020-10-16 04:57:25,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:25,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 671 transitions. [2020-10-16 04:57:25,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:25,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:25,868 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:25,868 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 56 flow. Second operand 8 states and 671 transitions. [2020-10-16 04:57:25,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 214 flow [2020-10-16 04:57:25,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 49 transitions, 206 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:25,872 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 140 flow [2020-10-16 04:57:25,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=140, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2020-10-16 04:57:25,872 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2020-10-16 04:57:25,873 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 140 flow [2020-10-16 04:57:25,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:25,873 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:25,873 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:25,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:57:25,873 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:57:25,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1327138756, now seen corresponding path program 2 times [2020-10-16 04:57:25,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:25,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035248993] [2020-10-16 04:57:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:26,008 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:57:26,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035248993] [2020-10-16 04:57:26,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:26,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:26,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330524340] [2020-10-16 04:57:26,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:57:26,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:57:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:57:26,012 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 04:57:26,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 140 flow. Second operand 6 states. [2020-10-16 04:57:26,013 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:26,013 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 04:57:26,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:26,322 INFO L129 PetriNetUnfolder]: 75/181 cut-off events. [2020-10-16 04:57:26,323 INFO L130 PetriNetUnfolder]: For 124/126 co-relation queries the response was YES. [2020-10-16 04:57:26,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 181 events. 75/181 cut-off events. For 124/126 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 791 event pairs, 8 based on Foata normal form. 8/188 useless extension candidates. Maximal degree in co-relation 516. Up to 95 conditions per place. [2020-10-16 04:57:26,331 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 16 selfloop transitions, 16 changer transitions 7/47 dead transitions. [2020-10-16 04:57:26,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 287 flow [2020-10-16 04:57:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 737 transitions. [2020-10-16 04:57:26,335 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6182885906040269 [2020-10-16 04:57:26,336 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 737 transitions. [2020-10-16 04:57:26,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 737 transitions. [2020-10-16 04:57:26,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:26,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 737 transitions. [2020-10-16 04:57:26,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:26,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:26,341 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:26,341 INFO L185 Difference]: Start difference. First operand has 37 places, 30 transitions, 140 flow. Second operand 8 states and 737 transitions. [2020-10-16 04:57:26,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 287 flow [2020-10-16 04:57:26,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 285 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:57:26,346 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 248 flow [2020-10-16 04:57:26,346 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2020-10-16 04:57:26,346 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2020-10-16 04:57:26,346 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 248 flow [2020-10-16 04:57:26,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:57:26,347 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:26,347 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:26,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:57:26,347 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:57:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:26,347 INFO L82 PathProgramCache]: Analyzing trace with hash 612946017, now seen corresponding path program 1 times [2020-10-16 04:57:26,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:26,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071048399] [2020-10-16 04:57:26,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:26,598 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:57:26,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071048399] [2020-10-16 04:57:26,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:26,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:26,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166363183] [2020-10-16 04:57:26,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:57:26,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:57:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:57:26,602 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 04:57:26,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 248 flow. Second operand 6 states. [2020-10-16 04:57:26,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:26,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 04:57:26,602 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:26,935 INFO L129 PetriNetUnfolder]: 80/195 cut-off events. [2020-10-16 04:57:26,935 INFO L130 PetriNetUnfolder]: For 320/322 co-relation queries the response was YES. [2020-10-16 04:57:26,937 INFO L80 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 195 events. 80/195 cut-off events. For 320/322 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 893 event pairs, 8 based on Foata normal form. 4/197 useless extension candidates. Maximal degree in co-relation 745. Up to 101 conditions per place. [2020-10-16 04:57:26,939 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 22 selfloop transitions, 17 changer transitions 6/53 dead transitions. [2020-10-16 04:57:26,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 443 flow [2020-10-16 04:57:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 649 transitions. [2020-10-16 04:57:26,944 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6222435282837967 [2020-10-16 04:57:26,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 649 transitions. [2020-10-16 04:57:26,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 649 transitions. [2020-10-16 04:57:26,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:26,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 649 transitions. [2020-10-16 04:57:26,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:26,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:26,948 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:26,948 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 248 flow. Second operand 7 states and 649 transitions. [2020-10-16 04:57:26,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 443 flow [2020-10-16 04:57:26,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 434 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:26,958 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 356 flow [2020-10-16 04:57:26,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2020-10-16 04:57:26,958 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2020-10-16 04:57:26,959 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 356 flow [2020-10-16 04:57:26,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:57:26,959 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:26,959 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:26,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:57:26,959 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:57:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1808348918, now seen corresponding path program 1 times [2020-10-16 04:57:26,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:26,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787792000] [2020-10-16 04:57:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:27,468 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:57:27,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787792000] [2020-10-16 04:57:27,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:27,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:27,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859743294] [2020-10-16 04:57:27,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:27,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:27,471 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 149 [2020-10-16 04:57:27,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 356 flow. Second operand 9 states. [2020-10-16 04:57:27,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:27,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 149 [2020-10-16 04:57:27,472 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:27,892 INFO L129 PetriNetUnfolder]: 87/219 cut-off events. [2020-10-16 04:57:27,892 INFO L130 PetriNetUnfolder]: For 684/688 co-relation queries the response was YES. [2020-10-16 04:57:27,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 219 events. 87/219 cut-off events. For 684/688 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1031 event pairs, 4 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 1007. Up to 121 conditions per place. [2020-10-16 04:57:27,895 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 34 selfloop transitions, 29 changer transitions 3/74 dead transitions. [2020-10-16 04:57:27,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 751 flow [2020-10-16 04:57:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:57:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:57:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 944 transitions. [2020-10-16 04:57:27,901 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5759609517998779 [2020-10-16 04:57:27,901 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 944 transitions. [2020-10-16 04:57:27,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 944 transitions. [2020-10-16 04:57:27,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:27,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 944 transitions. [2020-10-16 04:57:27,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:57:27,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:57:27,907 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:57:27,907 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 356 flow. Second operand 11 states and 944 transitions. [2020-10-16 04:57:27,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 751 flow [2020-10-16 04:57:27,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 729 flow, removed 11 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:27,913 INFO L241 Difference]: Finished difference. Result has 64 places, 61 transitions, 624 flow [2020-10-16 04:57:27,913 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=624, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2020-10-16 04:57:27,914 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 37 predicate places. [2020-10-16 04:57:27,914 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 624 flow [2020-10-16 04:57:27,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:27,914 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:27,914 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:27,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:57:27,914 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:57:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2085798367, now seen corresponding path program 2 times [2020-10-16 04:57:27,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:27,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232812370] [2020-10-16 04:57:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:28,153 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:57:28,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232812370] [2020-10-16 04:57:28,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:28,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:28,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081044506] [2020-10-16 04:57:28,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:28,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:28,159 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 149 [2020-10-16 04:57:28,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 624 flow. Second operand 9 states. [2020-10-16 04:57:28,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:28,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 149 [2020-10-16 04:57:28,160 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:28,855 INFO L129 PetriNetUnfolder]: 274/525 cut-off events. [2020-10-16 04:57:28,855 INFO L130 PetriNetUnfolder]: For 2358/2374 co-relation queries the response was YES. [2020-10-16 04:57:28,858 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 525 events. 274/525 cut-off events. For 2358/2374 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2426 event pairs, 48 based on Foata normal form. 11/532 useless extension candidates. Maximal degree in co-relation 2550. Up to 230 conditions per place. [2020-10-16 04:57:28,862 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 52 selfloop transitions, 44 changer transitions 12/112 dead transitions. [2020-10-16 04:57:28,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 1256 flow [2020-10-16 04:57:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:57:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:57:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 845 transitions. [2020-10-16 04:57:28,866 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5155582672361196 [2020-10-16 04:57:28,866 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 845 transitions. [2020-10-16 04:57:28,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 845 transitions. [2020-10-16 04:57:28,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:28,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 845 transitions. [2020-10-16 04:57:28,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:57:28,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:57:28,871 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:57:28,871 INFO L185 Difference]: Start difference. First operand has 64 places, 61 transitions, 624 flow. Second operand 11 states and 845 transitions. [2020-10-16 04:57:28,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 1256 flow [2020-10-16 04:57:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 112 transitions, 1181 flow, removed 13 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:28,884 INFO L241 Difference]: Finished difference. Result has 73 places, 85 transitions, 995 flow [2020-10-16 04:57:28,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=995, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2020-10-16 04:57:28,885 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 46 predicate places. [2020-10-16 04:57:28,885 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 995 flow [2020-10-16 04:57:28,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:28,885 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:28,885 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:28,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:57:28,885 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:57:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash -701672185, now seen corresponding path program 3 times [2020-10-16 04:57:28,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:28,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924361713] [2020-10-16 04:57:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:29,133 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:57:29,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924361713] [2020-10-16 04:57:29,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:29,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:57:29,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14187139] [2020-10-16 04:57:29,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:57:29,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:57:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:57:29,136 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 149 [2020-10-16 04:57:29,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 995 flow. Second operand 11 states. [2020-10-16 04:57:29,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:29,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 149 [2020-10-16 04:57:29,137 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:29,926 INFO L129 PetriNetUnfolder]: 286/575 cut-off events. [2020-10-16 04:57:29,926 INFO L130 PetriNetUnfolder]: For 3540/3556 co-relation queries the response was YES. [2020-10-16 04:57:29,931 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3220 conditions, 575 events. 286/575 cut-off events. For 3540/3556 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2863 event pairs, 33 based on Foata normal form. 16/588 useless extension candidates. Maximal degree in co-relation 3185. Up to 234 conditions per place. [2020-10-16 04:57:29,938 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 77 selfloop transitions, 36 changer transitions 21/138 dead transitions. [2020-10-16 04:57:29,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 138 transitions, 1745 flow [2020-10-16 04:57:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 04:57:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 04:57:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1165 transitions. [2020-10-16 04:57:29,945 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5212527964205816 [2020-10-16 04:57:29,945 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1165 transitions. [2020-10-16 04:57:29,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1165 transitions. [2020-10-16 04:57:29,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:29,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1165 transitions. [2020-10-16 04:57:29,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 04:57:29,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 04:57:29,956 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 04:57:29,956 INFO L185 Difference]: Start difference. First operand has 73 places, 85 transitions, 995 flow. Second operand 15 states and 1165 transitions. [2020-10-16 04:57:29,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 138 transitions, 1745 flow [2020-10-16 04:57:29,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 138 transitions, 1688 flow, removed 24 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:29,982 INFO L241 Difference]: Finished difference. Result has 89 places, 91 transitions, 1153 flow [2020-10-16 04:57:29,983 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1153, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2020-10-16 04:57:29,983 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 62 predicate places. [2020-10-16 04:57:29,983 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 1153 flow [2020-10-16 04:57:29,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:57:29,984 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:29,984 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:29,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:57:29,985 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:57:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -567851974, now seen corresponding path program 2 times [2020-10-16 04:57:29,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:29,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748682414] [2020-10-16 04:57:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:30,573 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:57:30,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748682414] [2020-10-16 04:57:30,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:30,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:30,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396621994] [2020-10-16 04:57:30,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:30,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:30,577 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:30,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 1153 flow. Second operand 10 states. [2020-10-16 04:57:30,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:30,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:30,578 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:30,931 INFO L129 PetriNetUnfolder]: 96/262 cut-off events. [2020-10-16 04:57:30,931 INFO L130 PetriNetUnfolder]: For 1936/1946 co-relation queries the response was YES. [2020-10-16 04:57:30,933 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 262 events. 96/262 cut-off events. For 1936/1946 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1411 event pairs, 8 based on Foata normal form. 12/270 useless extension candidates. Maximal degree in co-relation 1664. Up to 166 conditions per place. [2020-10-16 04:57:30,935 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 45 selfloop transitions, 35 changer transitions 7/97 dead transitions. [2020-10-16 04:57:30,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 97 transitions, 1403 flow [2020-10-16 04:57:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 638 transitions. [2020-10-16 04:57:30,939 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6116970278044104 [2020-10-16 04:57:30,939 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 638 transitions. [2020-10-16 04:57:30,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 638 transitions. [2020-10-16 04:57:30,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:30,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 638 transitions. [2020-10-16 04:57:30,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:30,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:30,943 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:30,943 INFO L185 Difference]: Start difference. First operand has 89 places, 91 transitions, 1153 flow. Second operand 7 states and 638 transitions. [2020-10-16 04:57:30,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 97 transitions, 1403 flow [2020-10-16 04:57:30,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 97 transitions, 1329 flow, removed 12 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:30,956 INFO L241 Difference]: Finished difference. Result has 89 places, 89 transitions, 1170 flow [2020-10-16 04:57:30,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1170, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2020-10-16 04:57:30,957 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 62 predicate places. [2020-10-16 04:57:30,957 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 1170 flow [2020-10-16 04:57:30,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:30,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:30,957 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:30,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:57:30,958 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:57:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2077568522, now seen corresponding path program 3 times [2020-10-16 04:57:30,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:30,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413996486] [2020-10-16 04:57:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:31,441 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:57:31,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413996486] [2020-10-16 04:57:31,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:31,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:31,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662222231] [2020-10-16 04:57:31,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:31,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:31,446 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 149 [2020-10-16 04:57:31,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 1170 flow. Second operand 10 states. [2020-10-16 04:57:31,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:31,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 149 [2020-10-16 04:57:31,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:31,905 INFO L129 PetriNetUnfolder]: 98/257 cut-off events. [2020-10-16 04:57:31,905 INFO L130 PetriNetUnfolder]: For 2323/2343 co-relation queries the response was YES. [2020-10-16 04:57:31,907 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 257 events. 98/257 cut-off events. For 2323/2343 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1347 event pairs, 8 based on Foata normal form. 14/266 useless extension candidates. Maximal degree in co-relation 1714. Up to 153 conditions per place. [2020-10-16 04:57:31,909 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 59 selfloop transitions, 31 changer transitions 3/103 dead transitions. [2020-10-16 04:57:31,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 103 transitions, 1551 flow [2020-10-16 04:57:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 712 transitions. [2020-10-16 04:57:31,913 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5973154362416108 [2020-10-16 04:57:31,913 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 712 transitions. [2020-10-16 04:57:31,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 712 transitions. [2020-10-16 04:57:31,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:31,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 712 transitions. [2020-10-16 04:57:31,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:31,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:31,918 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:31,918 INFO L185 Difference]: Start difference. First operand has 89 places, 89 transitions, 1170 flow. Second operand 8 states and 712 transitions. [2020-10-16 04:57:31,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 103 transitions, 1551 flow [2020-10-16 04:57:31,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 103 transitions, 1483 flow, removed 13 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:31,936 INFO L241 Difference]: Finished difference. Result has 90 places, 93 transitions, 1283 flow [2020-10-16 04:57:31,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1283, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2020-10-16 04:57:31,937 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 63 predicate places. [2020-10-16 04:57:31,937 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 1283 flow [2020-10-16 04:57:31,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:31,937 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:31,937 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:31,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:57:31,938 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:31,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:31,938 INFO L82 PathProgramCache]: Analyzing trace with hash 223086467, now seen corresponding path program 4 times [2020-10-16 04:57:31,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:31,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846660371] [2020-10-16 04:57:31,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:32,179 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:57:32,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846660371] [2020-10-16 04:57:32,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:32,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:32,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493569270] [2020-10-16 04:57:32,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:32,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:32,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:32,181 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 04:57:32,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 1283 flow. Second operand 10 states. [2020-10-16 04:57:32,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:32,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 04:57:32,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:32,763 INFO L129 PetriNetUnfolder]: 117/303 cut-off events. [2020-10-16 04:57:32,764 INFO L130 PetriNetUnfolder]: For 2828/2840 co-relation queries the response was YES. [2020-10-16 04:57:32,766 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 303 events. 117/303 cut-off events. For 2828/2840 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1655 event pairs, 6 based on Foata normal form. 15/315 useless extension candidates. Maximal degree in co-relation 2027. Up to 183 conditions per place. [2020-10-16 04:57:32,771 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 76 selfloop transitions, 48 changer transitions 0/134 dead transitions. [2020-10-16 04:57:32,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 2004 flow [2020-10-16 04:57:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:57:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:57:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 989 transitions. [2020-10-16 04:57:32,777 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6034167175106773 [2020-10-16 04:57:32,777 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 989 transitions. [2020-10-16 04:57:32,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 989 transitions. [2020-10-16 04:57:32,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:32,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 989 transitions. [2020-10-16 04:57:32,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:57:32,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:57:32,787 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:57:32,787 INFO L185 Difference]: Start difference. First operand has 90 places, 93 transitions, 1283 flow. Second operand 11 states and 989 transitions. [2020-10-16 04:57:32,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 2004 flow [2020-10-16 04:57:32,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 1955 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:32,817 INFO L241 Difference]: Finished difference. Result has 99 places, 119 transitions, 1754 flow [2020-10-16 04:57:32,819 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1754, PETRI_PLACES=99, PETRI_TRANSITIONS=119} [2020-10-16 04:57:32,819 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 72 predicate places. [2020-10-16 04:57:32,820 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 119 transitions, 1754 flow [2020-10-16 04:57:32,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:32,820 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:32,820 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:32,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:57:32,821 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash -431098944, now seen corresponding path program 4 times [2020-10-16 04:57:32,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:32,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608817840] [2020-10-16 04:57:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:33,260 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:57:33,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608817840] [2020-10-16 04:57:33,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:33,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:33,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467771241] [2020-10-16 04:57:33,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:33,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:33,263 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 149 [2020-10-16 04:57:33,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 119 transitions, 1754 flow. Second operand 8 states. [2020-10-16 04:57:33,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:33,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 149 [2020-10-16 04:57:33,264 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:33,796 INFO L129 PetriNetUnfolder]: 131/349 cut-off events. [2020-10-16 04:57:33,796 INFO L130 PetriNetUnfolder]: For 3982/4003 co-relation queries the response was YES. [2020-10-16 04:57:33,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 349 events. 131/349 cut-off events. For 3982/4003 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2070 event pairs, 8 based on Foata normal form. 15/360 useless extension candidates. Maximal degree in co-relation 2555. Up to 165 conditions per place. [2020-10-16 04:57:33,803 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 51 selfloop transitions, 56 changer transitions 21/138 dead transitions. [2020-10-16 04:57:33,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 138 transitions, 2255 flow [2020-10-16 04:57:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:57:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:57:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 867 transitions. [2020-10-16 04:57:33,807 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5818791946308725 [2020-10-16 04:57:33,808 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 867 transitions. [2020-10-16 04:57:33,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 867 transitions. [2020-10-16 04:57:33,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:33,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 867 transitions. [2020-10-16 04:57:33,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:57:33,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:57:33,812 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:57:33,812 INFO L185 Difference]: Start difference. First operand has 99 places, 119 transitions, 1754 flow. Second operand 10 states and 867 transitions. [2020-10-16 04:57:33,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 138 transitions, 2255 flow [2020-10-16 04:57:33,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 138 transitions, 2158 flow, removed 48 selfloop flow, removed 1 redundant places. [2020-10-16 04:57:33,834 INFO L241 Difference]: Finished difference. Result has 113 places, 110 transitions, 1827 flow [2020-10-16 04:57:33,834 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1827, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2020-10-16 04:57:33,834 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2020-10-16 04:57:33,834 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 1827 flow [2020-10-16 04:57:33,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:33,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:33,835 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:33,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:57:33,835 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -306668989, now seen corresponding path program 5 times [2020-10-16 04:57:33,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:33,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739037096] [2020-10-16 04:57:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:34,211 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:57:34,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739037096] [2020-10-16 04:57:34,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:34,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:34,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982026739] [2020-10-16 04:57:34,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:34,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:34,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:34,215 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 04:57:34,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 1827 flow. Second operand 9 states. [2020-10-16 04:57:34,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:34,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 04:57:34,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:34,840 INFO L129 PetriNetUnfolder]: 94/275 cut-off events. [2020-10-16 04:57:34,840 INFO L130 PetriNetUnfolder]: For 4846/4866 co-relation queries the response was YES. [2020-10-16 04:57:34,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 275 events. 94/275 cut-off events. For 4846/4866 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1613 event pairs, 3 based on Foata normal form. 17/288 useless extension candidates. Maximal degree in co-relation 2185. Up to 100 conditions per place. [2020-10-16 04:57:34,847 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 60 selfloop transitions, 49 changer transitions 7/126 dead transitions. [2020-10-16 04:57:34,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 2301 flow [2020-10-16 04:57:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 735 transitions. [2020-10-16 04:57:34,852 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6166107382550335 [2020-10-16 04:57:34,852 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 735 transitions. [2020-10-16 04:57:34,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 735 transitions. [2020-10-16 04:57:34,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:34,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 735 transitions. [2020-10-16 04:57:34,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:34,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:34,859 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:34,859 INFO L185 Difference]: Start difference. First operand has 113 places, 110 transitions, 1827 flow. Second operand 8 states and 735 transitions. [2020-10-16 04:57:34,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 2301 flow [2020-10-16 04:57:34,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 2178 flow, removed 22 selfloop flow, removed 11 redundant places. [2020-10-16 04:57:34,892 INFO L241 Difference]: Finished difference. Result has 106 places, 110 transitions, 1868 flow [2020-10-16 04:57:34,893 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1725, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1868, PETRI_PLACES=106, PETRI_TRANSITIONS=110} [2020-10-16 04:57:34,893 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 79 predicate places. [2020-10-16 04:57:34,894 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 110 transitions, 1868 flow [2020-10-16 04:57:34,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:34,894 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:34,894 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:34,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:57:34,895 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1702670729, now seen corresponding path program 1 times [2020-10-16 04:57:34,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:34,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843854700] [2020-10-16 04:57:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:35,256 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:57:35,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843854700] [2020-10-16 04:57:35,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:35,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:35,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980460103] [2020-10-16 04:57:35,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:35,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:35,261 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:35,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 110 transitions, 1868 flow. Second operand 9 states. [2020-10-16 04:57:35,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:35,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:35,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:35,646 INFO L129 PetriNetUnfolder]: 97/291 cut-off events. [2020-10-16 04:57:35,646 INFO L130 PetriNetUnfolder]: For 4995/5007 co-relation queries the response was YES. [2020-10-16 04:57:35,648 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 291 events. 97/291 cut-off events. For 4995/5007 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1779 event pairs, 5 based on Foata normal form. 8/295 useless extension candidates. Maximal degree in co-relation 2318. Up to 166 conditions per place. [2020-10-16 04:57:35,650 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 71 selfloop transitions, 17 changer transitions 33/128 dead transitions. [2020-10-16 04:57:35,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 128 transitions, 2374 flow [2020-10-16 04:57:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 640 transitions. [2020-10-16 04:57:35,653 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.613614573346117 [2020-10-16 04:57:35,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 640 transitions. [2020-10-16 04:57:35,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 640 transitions. [2020-10-16 04:57:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:35,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 640 transitions. [2020-10-16 04:57:35,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:35,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:35,656 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:35,656 INFO L185 Difference]: Start difference. First operand has 106 places, 110 transitions, 1868 flow. Second operand 7 states and 640 transitions. [2020-10-16 04:57:35,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 128 transitions, 2374 flow [2020-10-16 04:57:35,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 2258 flow, removed 4 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:35,680 INFO L241 Difference]: Finished difference. Result has 106 places, 94 transitions, 1542 flow [2020-10-16 04:57:35,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1542, PETRI_PLACES=106, PETRI_TRANSITIONS=94} [2020-10-16 04:57:35,680 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 79 predicate places. [2020-10-16 04:57:35,680 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 94 transitions, 1542 flow [2020-10-16 04:57:35,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:35,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:35,681 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:35,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:57:35,681 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:35,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash -959821979, now seen corresponding path program 2 times [2020-10-16 04:57:35,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:35,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716743841] [2020-10-16 04:57:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:57:36,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716743841] [2020-10-16 04:57:36,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:36,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:36,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955259582] [2020-10-16 04:57:36,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:36,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:36,126 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 149 [2020-10-16 04:57:36,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 94 transitions, 1542 flow. Second operand 10 states. [2020-10-16 04:57:36,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:36,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 149 [2020-10-16 04:57:36,127 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:36,536 INFO L129 PetriNetUnfolder]: 71/236 cut-off events. [2020-10-16 04:57:36,536 INFO L130 PetriNetUnfolder]: For 3675/3700 co-relation queries the response was YES. [2020-10-16 04:57:36,537 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 236 events. 71/236 cut-off events. For 3675/3700 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1363 event pairs, 4 based on Foata normal form. 14/246 useless extension candidates. Maximal degree in co-relation 1815. Up to 127 conditions per place. [2020-10-16 04:57:36,539 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 53 selfloop transitions, 34 changer transitions 15/109 dead transitions. [2020-10-16 04:57:36,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 1910 flow [2020-10-16 04:57:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 775 transitions. [2020-10-16 04:57:36,543 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5779269202087994 [2020-10-16 04:57:36,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 775 transitions. [2020-10-16 04:57:36,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 775 transitions. [2020-10-16 04:57:36,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:36,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 775 transitions. [2020-10-16 04:57:36,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:36,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:36,550 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:36,550 INFO L185 Difference]: Start difference. First operand has 106 places, 94 transitions, 1542 flow. Second operand 9 states and 775 transitions. [2020-10-16 04:57:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 1910 flow [2020-10-16 04:57:36,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 109 transitions, 1839 flow, removed 5 selfloop flow, removed 8 redundant places. [2020-10-16 04:57:36,570 INFO L241 Difference]: Finished difference. Result has 105 places, 91 transitions, 1499 flow [2020-10-16 04:57:36,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1499, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2020-10-16 04:57:36,570 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2020-10-16 04:57:36,570 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 1499 flow [2020-10-16 04:57:36,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:36,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:36,571 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:36,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:57:36,571 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2013374999, now seen corresponding path program 3 times [2020-10-16 04:57:36,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:36,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895003965] [2020-10-16 04:57:36,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:36,797 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:57:36,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895003965] [2020-10-16 04:57:36,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:36,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:36,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110954525] [2020-10-16 04:57:36,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:36,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:36,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:36,803 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 149 [2020-10-16 04:57:36,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 1499 flow. Second operand 8 states. [2020-10-16 04:57:36,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:36,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 149 [2020-10-16 04:57:36,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:37,110 INFO L129 PetriNetUnfolder]: 70/231 cut-off events. [2020-10-16 04:57:37,111 INFO L130 PetriNetUnfolder]: For 3576/3594 co-relation queries the response was YES. [2020-10-16 04:57:37,112 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1828 conditions, 231 events. 70/231 cut-off events. For 3576/3594 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1336 event pairs, 1 based on Foata normal form. 13/242 useless extension candidates. Maximal degree in co-relation 1780. Up to 151 conditions per place. [2020-10-16 04:57:37,114 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 69 selfloop transitions, 19 changer transitions 15/110 dead transitions. [2020-10-16 04:57:37,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 1935 flow [2020-10-16 04:57:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2020-10-16 04:57:37,121 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6347075743048898 [2020-10-16 04:57:37,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2020-10-16 04:57:37,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2020-10-16 04:57:37,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:37,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2020-10-16 04:57:37,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:37,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:37,124 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:37,124 INFO L185 Difference]: Start difference. First operand has 105 places, 91 transitions, 1499 flow. Second operand 7 states and 662 transitions. [2020-10-16 04:57:37,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 1935 flow [2020-10-16 04:57:37,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 110 transitions, 1856 flow, removed 3 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:37,139 INFO L241 Difference]: Finished difference. Result has 106 places, 95 transitions, 1499 flow [2020-10-16 04:57:37,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1499, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2020-10-16 04:57:37,140 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 79 predicate places. [2020-10-16 04:57:37,140 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 95 transitions, 1499 flow [2020-10-16 04:57:37,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:37,140 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:37,140 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:37,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:57:37,141 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1331788843, now seen corresponding path program 4 times [2020-10-16 04:57:37,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:37,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699591531] [2020-10-16 04:57:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:37,468 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:57:37,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699591531] [2020-10-16 04:57:37,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:37,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:37,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940544016] [2020-10-16 04:57:37,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:37,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:37,471 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:37,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 95 transitions, 1499 flow. Second operand 9 states. [2020-10-16 04:57:37,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:37,472 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:37,472 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:37,868 INFO L129 PetriNetUnfolder]: 60/208 cut-off events. [2020-10-16 04:57:37,868 INFO L130 PetriNetUnfolder]: For 3124/3142 co-relation queries the response was YES. [2020-10-16 04:57:37,870 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 208 events. 60/208 cut-off events. For 3124/3142 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1154 event pairs, 1 based on Foata normal form. 9/215 useless extension candidates. Maximal degree in co-relation 1594. Up to 143 conditions per place. [2020-10-16 04:57:37,873 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 70 selfloop transitions, 11 changer transitions 14/102 dead transitions. [2020-10-16 04:57:37,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1783 flow [2020-10-16 04:57:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 724 transitions. [2020-10-16 04:57:37,877 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6073825503355704 [2020-10-16 04:57:37,877 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 724 transitions. [2020-10-16 04:57:37,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 724 transitions. [2020-10-16 04:57:37,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:37,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 724 transitions. [2020-10-16 04:57:37,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:37,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:37,882 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:37,882 INFO L185 Difference]: Start difference. First operand has 106 places, 95 transitions, 1499 flow. Second operand 8 states and 724 transitions. [2020-10-16 04:57:37,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1783 flow [2020-10-16 04:57:37,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 1769 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:37,906 INFO L241 Difference]: Finished difference. Result has 110 places, 88 transitions, 1389 flow [2020-10-16 04:57:37,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1389, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2020-10-16 04:57:37,907 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 83 predicate places. [2020-10-16 04:57:37,907 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 1389 flow [2020-10-16 04:57:37,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:37,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:37,907 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:37,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:57:37,908 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -849096105, now seen corresponding path program 5 times [2020-10-16 04:57:37,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:37,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092178761] [2020-10-16 04:57:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:38,101 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:57:38,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092178761] [2020-10-16 04:57:38,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:38,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:38,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088875680] [2020-10-16 04:57:38,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:38,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:38,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:38,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:38,104 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 149 [2020-10-16 04:57:38,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 1389 flow. Second operand 10 states. [2020-10-16 04:57:38,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:38,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 149 [2020-10-16 04:57:38,105 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:38,500 INFO L129 PetriNetUnfolder]: 151/341 cut-off events. [2020-10-16 04:57:38,500 INFO L130 PetriNetUnfolder]: For 4797/4804 co-relation queries the response was YES. [2020-10-16 04:57:38,502 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 341 events. 151/341 cut-off events. For 4797/4804 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1564 event pairs, 21 based on Foata normal form. 7/348 useless extension candidates. Maximal degree in co-relation 2352. Up to 274 conditions per place. [2020-10-16 04:57:38,505 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 70 selfloop transitions, 10 changer transitions 19/103 dead transitions. [2020-10-16 04:57:38,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 1720 flow [2020-10-16 04:57:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 548 transitions. [2020-10-16 04:57:38,507 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5254074784276127 [2020-10-16 04:57:38,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 548 transitions. [2020-10-16 04:57:38,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 548 transitions. [2020-10-16 04:57:38,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:38,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 548 transitions. [2020-10-16 04:57:38,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:38,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:38,510 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:38,510 INFO L185 Difference]: Start difference. First operand has 110 places, 88 transitions, 1389 flow. Second operand 7 states and 548 transitions. [2020-10-16 04:57:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 1720 flow [2020-10-16 04:57:38,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 1657 flow, removed 9 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:38,526 INFO L241 Difference]: Finished difference. Result has 105 places, 82 transitions, 1240 flow [2020-10-16 04:57:38,527 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1240, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2020-10-16 04:57:38,527 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2020-10-16 04:57:38,527 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 1240 flow [2020-10-16 04:57:38,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:38,527 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:38,527 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:38,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:57:38,528 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:38,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash -808322393, now seen corresponding path program 6 times [2020-10-16 04:57:38,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:38,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435305679] [2020-10-16 04:57:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:38,785 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:57:38,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435305679] [2020-10-16 04:57:38,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:38,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:38,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751601467] [2020-10-16 04:57:38,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:38,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:38,789 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 149 [2020-10-16 04:57:38,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 1240 flow. Second operand 8 states. [2020-10-16 04:57:38,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:38,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 149 [2020-10-16 04:57:38,790 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:39,209 INFO L129 PetriNetUnfolder]: 61/219 cut-off events. [2020-10-16 04:57:39,210 INFO L130 PetriNetUnfolder]: For 2836/2868 co-relation queries the response was YES. [2020-10-16 04:57:39,211 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 219 events. 61/219 cut-off events. For 2836/2868 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1286 event pairs, 2 based on Foata normal form. 15/230 useless extension candidates. Maximal degree in co-relation 1622. Up to 91 conditions per place. [2020-10-16 04:57:39,213 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 54 selfloop transitions, 15 changer transitions 29/105 dead transitions. [2020-10-16 04:57:39,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 1753 flow [2020-10-16 04:57:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2020-10-16 04:57:39,215 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6251198465963567 [2020-10-16 04:57:39,215 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2020-10-16 04:57:39,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2020-10-16 04:57:39,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:39,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2020-10-16 04:57:39,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:39,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:39,217 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:39,218 INFO L185 Difference]: Start difference. First operand has 105 places, 82 transitions, 1240 flow. Second operand 7 states and 652 transitions. [2020-10-16 04:57:39,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 1753 flow [2020-10-16 04:57:39,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 105 transitions, 1711 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:39,232 INFO L241 Difference]: Finished difference. Result has 102 places, 74 transitions, 1064 flow [2020-10-16 04:57:39,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1064, PETRI_PLACES=102, PETRI_TRANSITIONS=74} [2020-10-16 04:57:39,233 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2020-10-16 04:57:39,233 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 1064 flow [2020-10-16 04:57:39,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:39,233 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:39,233 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:39,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 04:57:39,234 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash 764878559, now seen corresponding path program 7 times [2020-10-16 04:57:39,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:39,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483365718] [2020-10-16 04:57:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:39,706 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:57:39,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483365718] [2020-10-16 04:57:39,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:39,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:39,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601326268] [2020-10-16 04:57:39,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:39,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:39,709 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 149 [2020-10-16 04:57:39,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 74 transitions, 1064 flow. Second operand 10 states. [2020-10-16 04:57:39,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:39,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 149 [2020-10-16 04:57:39,710 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:40,300 INFO L129 PetriNetUnfolder]: 38/164 cut-off events. [2020-10-16 04:57:40,300 INFO L130 PetriNetUnfolder]: For 2106/2147 co-relation queries the response was YES. [2020-10-16 04:57:40,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 164 events. 38/164 cut-off events. For 2106/2147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 881 event pairs, 1 based on Foata normal form. 16/177 useless extension candidates. Maximal degree in co-relation 1223. Up to 65 conditions per place. [2020-10-16 04:57:40,301 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 29 selfloop transitions, 21 changer transitions 24/81 dead transitions. [2020-10-16 04:57:40,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 81 transitions, 1315 flow [2020-10-16 04:57:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:57:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:57:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 859 transitions. [2020-10-16 04:57:40,304 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5765100671140939 [2020-10-16 04:57:40,304 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 859 transitions. [2020-10-16 04:57:40,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 859 transitions. [2020-10-16 04:57:40,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:40,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 859 transitions. [2020-10-16 04:57:40,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:57:40,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:57:40,307 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:57:40,307 INFO L185 Difference]: Start difference. First operand has 102 places, 74 transitions, 1064 flow. Second operand 10 states and 859 transitions. [2020-10-16 04:57:40,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 81 transitions, 1315 flow [2020-10-16 04:57:40,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 81 transitions, 1271 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:40,319 INFO L241 Difference]: Finished difference. Result has 105 places, 56 transitions, 790 flow [2020-10-16 04:57:40,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=105, PETRI_TRANSITIONS=56} [2020-10-16 04:57:40,319 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2020-10-16 04:57:40,319 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 56 transitions, 790 flow [2020-10-16 04:57:40,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:40,319 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:40,319 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:40,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 04:57:40,320 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:40,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash -804147783, now seen corresponding path program 8 times [2020-10-16 04:57:40,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:40,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252175830] [2020-10-16 04:57:40,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:40,672 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:57:40,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252175830] [2020-10-16 04:57:40,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:40,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:40,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761886123] [2020-10-16 04:57:40,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:40,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:40,675 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 149 [2020-10-16 04:57:40,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 56 transitions, 790 flow. Second operand 9 states. [2020-10-16 04:57:40,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:40,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 149 [2020-10-16 04:57:40,676 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:41,134 INFO L129 PetriNetUnfolder]: 21/112 cut-off events. [2020-10-16 04:57:41,134 INFO L130 PetriNetUnfolder]: For 1619/1641 co-relation queries the response was YES. [2020-10-16 04:57:41,135 INFO L80 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 112 events. 21/112 cut-off events. For 1619/1641 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 495 event pairs, 1 based on Foata normal form. 7/119 useless extension candidates. Maximal degree in co-relation 828. Up to 47 conditions per place. [2020-10-16 04:57:41,136 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 31 selfloop transitions, 10 changer transitions 17/65 dead transitions. [2020-10-16 04:57:41,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 65 transitions, 1030 flow [2020-10-16 04:57:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 713 transitions. [2020-10-16 04:57:41,138 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5981543624161074 [2020-10-16 04:57:41,138 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 713 transitions. [2020-10-16 04:57:41,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 713 transitions. [2020-10-16 04:57:41,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:41,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 713 transitions. [2020-10-16 04:57:41,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:41,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:41,141 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:41,141 INFO L185 Difference]: Start difference. First operand has 105 places, 56 transitions, 790 flow. Second operand 8 states and 713 transitions. [2020-10-16 04:57:41,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 65 transitions, 1030 flow [2020-10-16 04:57:41,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 65 transitions, 888 flow, removed 27 selfloop flow, removed 20 redundant places. [2020-10-16 04:57:41,150 INFO L241 Difference]: Finished difference. Result has 90 places, 44 transitions, 516 flow [2020-10-16 04:57:41,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=90, PETRI_TRANSITIONS=44} [2020-10-16 04:57:41,151 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 63 predicate places. [2020-10-16 04:57:41,151 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 44 transitions, 516 flow [2020-10-16 04:57:41,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:41,151 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:41,151 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:41,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 04:57:41,152 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash 151379857, now seen corresponding path program 9 times [2020-10-16 04:57:41,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:41,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561376735] [2020-10-16 04:57:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:41,280 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:57:41,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561376735] [2020-10-16 04:57:41,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:41,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:41,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943850627] [2020-10-16 04:57:41,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:41,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:41,282 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 149 [2020-10-16 04:57:41,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 44 transitions, 516 flow. Second operand 7 states. [2020-10-16 04:57:41,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:41,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 149 [2020-10-16 04:57:41,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:41,424 INFO L129 PetriNetUnfolder]: 16/81 cut-off events. [2020-10-16 04:57:41,425 INFO L130 PetriNetUnfolder]: For 846/854 co-relation queries the response was YES. [2020-10-16 04:57:41,425 INFO L80 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 81 events. 16/81 cut-off events. For 846/854 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 296 event pairs, 2 based on Foata normal form. 4/85 useless extension candidates. Maximal degree in co-relation 556. Up to 39 conditions per place. [2020-10-16 04:57:41,426 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 7 selfloop transitions, 3 changer transitions 28/46 dead transitions. [2020-10-16 04:57:41,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 46 transitions, 620 flow [2020-10-16 04:57:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:57:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:57:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 578 transitions. [2020-10-16 04:57:41,428 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6465324384787472 [2020-10-16 04:57:41,428 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 578 transitions. [2020-10-16 04:57:41,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 578 transitions. [2020-10-16 04:57:41,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:41,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 578 transitions. [2020-10-16 04:57:41,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:57:41,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:57:41,430 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:57:41,430 INFO L185 Difference]: Start difference. First operand has 90 places, 44 transitions, 516 flow. Second operand 6 states and 578 transitions. [2020-10-16 04:57:41,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 46 transitions, 620 flow [2020-10-16 04:57:41,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 46 transitions, 532 flow, removed 9 selfloop flow, removed 15 redundant places. [2020-10-16 04:57:41,435 INFO L241 Difference]: Finished difference. Result has 77 places, 18 transitions, 123 flow [2020-10-16 04:57:41,436 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=77, PETRI_TRANSITIONS=18} [2020-10-16 04:57:41,436 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 50 predicate places. [2020-10-16 04:57:41,436 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 18 transitions, 123 flow [2020-10-16 04:57:41,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:41,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:41,436 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:41,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 04:57:41,437 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1722867447, now seen corresponding path program 1 times [2020-10-16 04:57:41,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:41,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093212739] [2020-10-16 04:57:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:41,584 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:57:41,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093212739] [2020-10-16 04:57:41,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:41,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:41,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640248496] [2020-10-16 04:57:41,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:57:41,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:57:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:57:41,587 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 149 [2020-10-16 04:57:41,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 18 transitions, 123 flow. Second operand 6 states. [2020-10-16 04:57:41,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:41,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 149 [2020-10-16 04:57:41,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:41,694 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2020-10-16 04:57:41,694 INFO L130 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2020-10-16 04:57:41,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 17 events. 0/17 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2020-10-16 04:57:41,694 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2020-10-16 04:57:41,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 17 transitions, 137 flow [2020-10-16 04:57:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 648 transitions. [2020-10-16 04:57:41,696 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6212847555129435 [2020-10-16 04:57:41,696 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 648 transitions. [2020-10-16 04:57:41,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 648 transitions. [2020-10-16 04:57:41,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:41,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 648 transitions. [2020-10-16 04:57:41,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:41,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:41,699 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:41,699 INFO L185 Difference]: Start difference. First operand has 77 places, 18 transitions, 123 flow. Second operand 7 states and 648 transitions. [2020-10-16 04:57:41,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 17 transitions, 137 flow [2020-10-16 04:57:41,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 17 transitions, 78 flow, removed 8 selfloop flow, removed 25 redundant places. [2020-10-16 04:57:41,700 INFO L241 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2020-10-16 04:57:41,700 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2020-10-16 04:57:41,700 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2020-10-16 04:57:41,700 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2020-10-16 04:57:41,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:57:41,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 04:57:41,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:57:41 BasicIcfg [2020-10-16 04:57:41,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:57:41,710 INFO L168 Benchmark]: Toolchain (without parser) took 26680.87 ms. Allocated memory was 253.2 MB in the beginning and 780.7 MB in the end (delta: 527.4 MB). Free memory was 208.6 MB in the beginning and 422.8 MB in the end (delta: -214.2 MB). Peak memory consumption was 313.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:41,710 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:57:41,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.17 ms. Allocated memory was 253.2 MB in the beginning and 325.6 MB in the end (delta: 72.4 MB). Free memory was 208.6 MB in the beginning and 273.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:41,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 325.6 MB. Free memory was 273.3 MB in the beginning and 270.7 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:57:41,713 INFO L168 Benchmark]: Boogie Preprocessor took 47.14 ms. Allocated memory is still 325.6 MB. Free memory was 270.7 MB in the beginning and 268.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:57:41,713 INFO L168 Benchmark]: RCFGBuilder took 3436.45 ms. Allocated memory was 325.6 MB in the beginning and 379.6 MB in the end (delta: 54.0 MB). Free memory was 268.2 MB in the beginning and 169.8 MB in the end (delta: 98.4 MB). Peak memory consumption was 152.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:41,718 INFO L168 Benchmark]: TraceAbstraction took 22369.90 ms. Allocated memory was 379.6 MB in the beginning and 780.7 MB in the end (delta: 401.1 MB). Free memory was 169.8 MB in the beginning and 422.8 MB in the end (delta: -253.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:41,721 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.37 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 750.17 ms. Allocated memory was 253.2 MB in the beginning and 325.6 MB in the end (delta: 72.4 MB). Free memory was 208.6 MB in the beginning and 273.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.29 ms. Allocated memory is still 325.6 MB. Free memory was 273.3 MB in the beginning and 270.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.14 ms. Allocated memory is still 325.6 MB. Free memory was 270.7 MB in the beginning and 268.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3436.45 ms. Allocated memory was 325.6 MB in the beginning and 379.6 MB in the end (delta: 54.0 MB). Free memory was 268.2 MB in the beginning and 169.8 MB in the end (delta: 98.4 MB). Peak memory consumption was 152.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 22369.90 ms. Allocated memory was 379.6 MB in the beginning and 780.7 MB in the end (delta: 401.1 MB). Free memory was 169.8 MB in the beginning and 422.8 MB in the end (delta: -253.0 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.4s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2967 MoverChecksTotal - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: 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: 22.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 161 SDtfs, 191 SDslu, 302 SDs, 0 SdLazy, 2070 SolverSat, 564 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1868occurred in iteration=14, 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, 1.0s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 61379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...