/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:19,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:19,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:19,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:19,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:19,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:19,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:19,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:19,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:19,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:19,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:19,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:19,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:19,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:19,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:19,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:19,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:19,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:19,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:19,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:19,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:19,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:19,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:19,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:19,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:19,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:19,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:19,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:19,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:19,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:19,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:19,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:19,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:19,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:19,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:19,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:19,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:19,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:19,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:19,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:19,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:19,129 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:19,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:19,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:19,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:19,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:19,159 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:19,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:19,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:19,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:19,161 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:19,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:19,161 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:19,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:19,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:19,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:19,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:19,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:19,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:19,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:19,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:19,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:19,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:19,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:19,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:19,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:19,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:19,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:19,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:19,474 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:19,476 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:19,477 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2020-10-16 04:57:19,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3759a85/33c7996661544d63b564e050d256c1dd/FLAG072b314eb [2020-10-16 04:57:20,069 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:20,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2020-10-16 04:57:20,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3759a85/33c7996661544d63b564e050d256c1dd/FLAG072b314eb [2020-10-16 04:57:20,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a3759a85/33c7996661544d63b564e050d256c1dd [2020-10-16 04:57:20,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:20,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:20,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:20,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:20,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:20,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:20" (1/1) ... [2020-10-16 04:57:20,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:20, skipping insertion in model container [2020-10-16 04:57:20,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:20" (1/1) ... [2020-10-16 04:57:20,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:20,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:21,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:21,020 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:21,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:21,163 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:21,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:21 WrapperNode [2020-10-16 04:57:21,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:21,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:21,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:21,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:21,174 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:21" (1/1) ... [2020-10-16 04:57:21,197 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:21" (1/1) ... [2020-10-16 04:57:21,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:21,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:21,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:21,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:21,248 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:21" (1/1) ... [2020-10-16 04:57:21,249 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:21" (1/1) ... [2020-10-16 04:57:21,254 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:21" (1/1) ... [2020-10-16 04:57:21,255 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:21" (1/1) ... [2020-10-16 04:57:21,269 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:21" (1/1) ... [2020-10-16 04:57:21,275 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:21" (1/1) ... [2020-10-16 04:57:21,280 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:21" (1/1) ... [2020-10-16 04:57:21,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:21,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:21,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:21,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:21,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:21" (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:21,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:21,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:21,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:21,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:21,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:21,366 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:24,983 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:24,983 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:57:24,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:24 BoogieIcfgContainer [2020-10-16 04:57:24,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:24,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:24,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:24,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:24,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:20" (1/3) ... [2020-10-16 04:57:24,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1f4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:24, skipping insertion in model container [2020-10-16 04:57:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:21" (2/3) ... [2020-10-16 04:57:24,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1f4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:24, skipping insertion in model container [2020-10-16 04:57:24,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:24" (3/3) ... [2020-10-16 04:57:24,995 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2020-10-16 04:57:25,007 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:25,017 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:57:25,018 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,069 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,073 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:25,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,073 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:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,123 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,136 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,137 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,155 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:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:25,177 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:57:25,201 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:57:25,201 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:57:25,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:57:25,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:57:25,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:57:25,201 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:57:25,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:57:25,202 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:57:25,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:57:25,260 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:57:25,261 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:25,266 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:25,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 04:57:25,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:25,275 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:57:25,278 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:25,281 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:25,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 04:57:25,310 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 04:57:25,310 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:25,311 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:25,313 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 04:57:25,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,410 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:25,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,448 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:25,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:25,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:25,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:25,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,590 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:25,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,592 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:25,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:25,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:25,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,682 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:25,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,684 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:25,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:25,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:25,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:25,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:25,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,771 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:25,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,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:25,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,894 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:25,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:25,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:25,920 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:25,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:25,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:25,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:25,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:26,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:26,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,232 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:26,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,233 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:26,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:26,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:26,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:26,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:26,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,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:26,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:26,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:26,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:26,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:26,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:26,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,335 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:26,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:26,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:26,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:26,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:26,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:26,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:26,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:26,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:26,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:26,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:26,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:26,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:26,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:26,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:26,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,610 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:26,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,613 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:26,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:26,903 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:57:27,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:27,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:27,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:27,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:27,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:27,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,092 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:27,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,093 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:27,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,191 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:27,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,193 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:27,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,195 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:27,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,197 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:27,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,200 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:27,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,201 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:27,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,206 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:27,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,209 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:27,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,308 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:27,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,310 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:27,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,312 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:27,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,313 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:27,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,316 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:27,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,319 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:27,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,321 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:27,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,327 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:27,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,330 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:27,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:27,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:27,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:27,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 04:57:27,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,825 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:27,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,827 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:27,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,828 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:27,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,830 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:27,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,833 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:27,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,834 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:27,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,840 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:27,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,842 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, 3, 2, 1] term [2020-10-16 04:57:27,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:27,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,928 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:27,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,929 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:27,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,931 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:27,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,932 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:27,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:27,935 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:27,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,938 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:27,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,940 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:27,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:27,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:27,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,944 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:27,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:27,946 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:27,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:28,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,031 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:28,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,034 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:28,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:28,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:28,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:28,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:28,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,229 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:28,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,230 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:28,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:28,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:28,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,583 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:28,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,602 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:28,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:28,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:28,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:28,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:28,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:28,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:28,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,856 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:28,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:28,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:28,886 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:28,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:28,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:57:28,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:28,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:28,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:28,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:29,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:29,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:29,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:29,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:29,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:29,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:29,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:29,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:29,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:29,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:29,024 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:29,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:29,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:29,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:29,681 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:57:29,776 INFO L132 LiptonReduction]: Checked pairs total: 2967 [2020-10-16 04:57:29,776 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 04:57:29,783 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4510 [2020-10-16 04:57:29,792 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 04:57:29,792 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:29,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:29,794 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:57:29,794 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:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-16 04:57:29,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:29,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731387103] [2020-10-16 04:57:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:30,029 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,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731387103] [2020-10-16 04:57:30,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:30,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:30,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851187302] [2020-10-16 04:57:30,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:30,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:30,063 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2020-10-16 04:57:30,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states. [2020-10-16 04:57:30,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:30,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2020-10-16 04:57:30,067 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:30,206 INFO L129 PetriNetUnfolder]: 57/144 cut-off events. [2020-10-16 04:57:30,206 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:30,207 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:30,210 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 12 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 04:57:30,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 82 flow [2020-10-16 04:57:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2020-10-16 04:57:30,228 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8232662192393736 [2020-10-16 04:57:30,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2020-10-16 04:57:30,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2020-10-16 04:57:30,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:30,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2020-10-16 04:57:30,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:30,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:30,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:30,250 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:30,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 82 flow [2020-10-16 04:57:30,254 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:30,256 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2020-10-16 04:57:30,259 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:30,260 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 04:57:30,260 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2020-10-16 04:57:30,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:30,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:30,261 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:30,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:57:30,261 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:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-16 04:57:30,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:30,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364104340] [2020-10-16 04:57:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:30,467 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,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364104340] [2020-10-16 04:57:30,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:30,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:30,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572149591] [2020-10-16 04:57:30,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:30,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:30,472 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2020-10-16 04:57:30,472 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 04:57:30,472 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:30,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2020-10-16 04:57:30,473 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:30,538 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 04:57:30,538 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:30,538 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:30,539 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2020-10-16 04:57:30,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 72 flow [2020-10-16 04:57:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2020-10-16 04:57:30,544 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8134228187919463 [2020-10-16 04:57:30,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2020-10-16 04:57:30,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2020-10-16 04:57:30,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:30,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2020-10-16 04:57:30,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:30,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:30,550 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:30,550 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:30,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 72 flow [2020-10-16 04:57:30,551 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:30,551 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 52 flow [2020-10-16 04:57:30,552 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:30,552 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 04:57:30,552 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 52 flow [2020-10-16 04:57:30,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:30,553 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:30,553 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:30,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:57:30,553 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:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 324774380, now seen corresponding path program 1 times [2020-10-16 04:57:30,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:30,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619621022] [2020-10-16 04:57:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:30,674 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,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619621022] [2020-10-16 04:57:30,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:30,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:30,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390003371] [2020-10-16 04:57:30,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:30,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:30,677 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 149 [2020-10-16 04:57:30,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 52 flow. Second operand 4 states. [2020-10-16 04:57:30,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:30,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 149 [2020-10-16 04:57:30,678 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:30,721 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 04:57:30,721 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:57:30,722 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:30,722 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 04:57:30,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 20 transitions, 70 flow [2020-10-16 04:57:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2020-10-16 04:57:30,725 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8295302013422818 [2020-10-16 04:57:30,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2020-10-16 04:57:30,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2020-10-16 04:57:30,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:30,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2020-10-16 04:57:30,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:30,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:30,729 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:30,730 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:30,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 20 transitions, 70 flow [2020-10-16 04:57:30,730 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:30,731 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 56 flow [2020-10-16 04:57:30,732 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:30,732 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 04:57:30,732 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 56 flow [2020-10-16 04:57:30,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:30,732 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:30,732 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:30,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:57:30,733 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:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1421855306, now seen corresponding path program 1 times [2020-10-16 04:57:30,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:30,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949335916] [2020-10-16 04:57:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:30,997 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,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949335916] [2020-10-16 04:57:30,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:30,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:30,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680687939] [2020-10-16 04:57:30,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:30,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:31,001 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 04:57:31,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 56 flow. Second operand 7 states. [2020-10-16 04:57:31,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:31,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 04:57:31,002 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:31,407 INFO L129 PetriNetUnfolder]: 62/152 cut-off events. [2020-10-16 04:57:31,407 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-16 04:57:31,408 INFO L80 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 152 events. 62/152 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 596 event pairs, 15 based on Foata normal form. 6/157 useless extension candidates. Maximal degree in co-relation 327. Up to 95 conditions per place. [2020-10-16 04:57:31,409 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 14 selfloop transitions, 10 changer transitions 6/37 dead transitions. [2020-10-16 04:57:31,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 159 flow [2020-10-16 04:57:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 720 transitions. [2020-10-16 04:57:31,413 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6040268456375839 [2020-10-16 04:57:31,413 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 720 transitions. [2020-10-16 04:57:31,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 720 transitions. [2020-10-16 04:57:31,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:31,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 720 transitions. [2020-10-16 04:57:31,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:31,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:31,418 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:31,418 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 56 flow. Second operand 8 states and 720 transitions. [2020-10-16 04:57:31,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 159 flow [2020-10-16 04:57:31,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 151 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:31,421 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 110 flow [2020-10-16 04:57:31,421 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2020-10-16 04:57:31,422 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2020-10-16 04:57:31,422 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 110 flow [2020-10-16 04:57:31,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:31,422 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:31,422 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:31,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:57:31,422 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:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:31,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1965049678, now seen corresponding path program 2 times [2020-10-16 04:57:31,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:31,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303789627] [2020-10-16 04:57:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:31,661 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,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303789627] [2020-10-16 04:57:31,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:31,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:31,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412884207] [2020-10-16 04:57:31,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:31,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:31,665 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:31,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 110 flow. Second operand 9 states. [2020-10-16 04:57:31,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:31,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:31,666 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:31,997 INFO L129 PetriNetUnfolder]: 70/167 cut-off events. [2020-10-16 04:57:31,997 INFO L130 PetriNetUnfolder]: For 139/141 co-relation queries the response was YES. [2020-10-16 04:57:31,998 INFO L80 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 167 events. 70/167 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 699 event pairs, 4 based on Foata normal form. 9/175 useless extension candidates. Maximal degree in co-relation 469. Up to 94 conditions per place. [2020-10-16 04:57:32,000 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 16 selfloop transitions, 14 changer transitions 8/45 dead transitions. [2020-10-16 04:57:32,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 268 flow [2020-10-16 04:57:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 821 transitions. [2020-10-16 04:57:32,004 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6122296793437733 [2020-10-16 04:57:32,004 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 821 transitions. [2020-10-16 04:57:32,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 821 transitions. [2020-10-16 04:57:32,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:32,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 821 transitions. [2020-10-16 04:57:32,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:32,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:32,010 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:32,010 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 110 flow. Second operand 9 states and 821 transitions. [2020-10-16 04:57:32,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 268 flow [2020-10-16 04:57:32,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 266 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 04:57:32,013 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 198 flow [2020-10-16 04:57:32,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2020-10-16 04:57:32,014 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 19 predicate places. [2020-10-16 04:57:32,014 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 198 flow [2020-10-16 04:57:32,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:32,014 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:32,014 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:32,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:57:32,014 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:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash -505922506, now seen corresponding path program 3 times [2020-10-16 04:57:32,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:32,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217771531] [2020-10-16 04:57:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:32,158 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,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217771531] [2020-10-16 04:57:32,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:32,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:32,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774846797] [2020-10-16 04:57:32,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:32,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:32,162 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 149 [2020-10-16 04:57:32,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 198 flow. Second operand 7 states. [2020-10-16 04:57:32,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:32,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 149 [2020-10-16 04:57:32,163 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:32,585 INFO L129 PetriNetUnfolder]: 205/383 cut-off events. [2020-10-16 04:57:32,585 INFO L130 PetriNetUnfolder]: For 801/805 co-relation queries the response was YES. [2020-10-16 04:57:32,588 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 383 events. 205/383 cut-off events. For 801/805 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1554 event pairs, 31 based on Foata normal form. 16/398 useless extension candidates. Maximal degree in co-relation 1301. Up to 252 conditions per place. [2020-10-16 04:57:32,591 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 26 selfloop transitions, 20 changer transitions 10/60 dead transitions. [2020-10-16 04:57:32,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 431 flow [2020-10-16 04:57:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2020-10-16 04:57:32,598 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5451155853840418 [2020-10-16 04:57:32,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 731 transitions. [2020-10-16 04:57:32,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 731 transitions. [2020-10-16 04:57:32,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:32,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 731 transitions. [2020-10-16 04:57:32,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:32,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:32,604 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:32,604 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 198 flow. Second operand 9 states and 731 transitions. [2020-10-16 04:57:32,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 431 flow [2020-10-16 04:57:32,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 415 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:32,612 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 315 flow [2020-10-16 04:57:32,612 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2020-10-16 04:57:32,612 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2020-10-16 04:57:32,612 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 315 flow [2020-10-16 04:57:32,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:32,613 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:32,613 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,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:57:32,613 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:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1754263128, now seen corresponding path program 1 times [2020-10-16 04:57:32,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:32,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336634463] [2020-10-16 04:57:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:33,171 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,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336634463] [2020-10-16 04:57:33,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:33,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:33,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64804910] [2020-10-16 04:57:33,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:33,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:33,175 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 04:57:33,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 315 flow. Second operand 10 states. [2020-10-16 04:57:33,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:33,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 04:57:33,176 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:33,485 INFO L129 PetriNetUnfolder]: 83/193 cut-off events. [2020-10-16 04:57:33,485 INFO L130 PetriNetUnfolder]: For 526/528 co-relation queries the response was YES. [2020-10-16 04:57:33,487 INFO L80 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 193 events. 83/193 cut-off events. For 526/528 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 876 event pairs, 4 based on Foata normal form. 5/197 useless extension candidates. Maximal degree in co-relation 857. Up to 114 conditions per place. [2020-10-16 04:57:33,489 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 29 selfloop transitions, 13 changer transitions 3/53 dead transitions. [2020-10-16 04:57:33,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 505 flow [2020-10-16 04:57:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2020-10-16 04:57:33,495 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6174496644295302 [2020-10-16 04:57:33,495 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2020-10-16 04:57:33,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2020-10-16 04:57:33,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:33,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2020-10-16 04:57:33,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:33,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:33,499 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:33,499 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 315 flow. Second operand 7 states and 644 transitions. [2020-10-16 04:57:33,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 505 flow [2020-10-16 04:57:33,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 467 flow, removed 10 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:33,506 INFO L241 Difference]: Finished difference. Result has 55 places, 44 transitions, 366 flow [2020-10-16 04:57:33,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2020-10-16 04:57:33,506 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2020-10-16 04:57:33,506 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 366 flow [2020-10-16 04:57:33,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:33,506 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:33,507 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,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:57:33,507 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:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1816383839, now seen corresponding path program 1 times [2020-10-16 04:57:33,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:33,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511124143] [2020-10-16 04:57:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:33,652 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,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511124143] [2020-10-16 04:57:33,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:33,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:33,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213281388] [2020-10-16 04:57:33,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:33,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:33,656 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 04:57:33,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 366 flow. Second operand 7 states. [2020-10-16 04:57:33,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:33,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 04:57:33,657 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:34,066 INFO L129 PetriNetUnfolder]: 87/202 cut-off events. [2020-10-16 04:57:34,067 INFO L130 PetriNetUnfolder]: For 681/683 co-relation queries the response was YES. [2020-10-16 04:57:34,070 INFO L80 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 202 events. 87/202 cut-off events. For 681/683 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 912 event pairs, 5 based on Foata normal form. 6/207 useless extension candidates. Maximal degree in co-relation 919. Up to 120 conditions per place. [2020-10-16 04:57:34,071 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 24 selfloop transitions, 20 changer transitions 5/57 dead transitions. [2020-10-16 04:57:34,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 546 flow [2020-10-16 04:57:34,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 808 transitions. [2020-10-16 04:57:34,077 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6025354213273676 [2020-10-16 04:57:34,077 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 808 transitions. [2020-10-16 04:57:34,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 808 transitions. [2020-10-16 04:57:34,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:34,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 808 transitions. [2020-10-16 04:57:34,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:34,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:34,084 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:34,084 INFO L185 Difference]: Start difference. First operand has 55 places, 44 transitions, 366 flow. Second operand 9 states and 808 transitions. [2020-10-16 04:57:34,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 546 flow [2020-10-16 04:57:34,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 506 flow, removed 12 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:34,092 INFO L241 Difference]: Finished difference. Result has 58 places, 48 transitions, 434 flow [2020-10-16 04:57:34,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2020-10-16 04:57:34,093 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2020-10-16 04:57:34,093 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 434 flow [2020-10-16 04:57:34,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:34,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:34,094 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:34,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:57:34,094 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:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash -940027025, now seen corresponding path program 2 times [2020-10-16 04:57:34,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:34,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24600918] [2020-10-16 04:57:34,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:34,277 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,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24600918] [2020-10-16 04:57:34,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:34,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:34,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705464588] [2020-10-16 04:57:34,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:34,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:34,281 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 149 [2020-10-16 04:57:34,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 434 flow. Second operand 8 states. [2020-10-16 04:57:34,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:34,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 149 [2020-10-16 04:57:34,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:34,924 INFO L129 PetriNetUnfolder]: 286/532 cut-off events. [2020-10-16 04:57:34,925 INFO L130 PetriNetUnfolder]: For 2130/2136 co-relation queries the response was YES. [2020-10-16 04:57:34,928 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 532 events. 286/532 cut-off events. For 2130/2136 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2387 event pairs, 52 based on Foata normal form. 9/540 useless extension candidates. Maximal degree in co-relation 2496. Up to 248 conditions per place. [2020-10-16 04:57:34,933 INFO L132 encePairwiseOnDemand]: 137/149 looper letters, 48 selfloop transitions, 51 changer transitions 8/111 dead transitions. [2020-10-16 04:57:34,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 1104 flow [2020-10-16 04:57:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 04:57:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 04:57:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1073 transitions. [2020-10-16 04:57:34,938 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5539494062983996 [2020-10-16 04:57:34,938 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1073 transitions. [2020-10-16 04:57:34,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1073 transitions. [2020-10-16 04:57:34,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:34,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1073 transitions. [2020-10-16 04:57:34,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 04:57:34,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 04:57:34,945 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 04:57:34,946 INFO L185 Difference]: Start difference. First operand has 58 places, 48 transitions, 434 flow. Second operand 13 states and 1073 transitions. [2020-10-16 04:57:34,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 1104 flow [2020-10-16 04:57:34,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 1055 flow, removed 17 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:34,956 INFO L241 Difference]: Finished difference. Result has 70 places, 88 transitions, 939 flow [2020-10-16 04:57:34,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=939, PETRI_PLACES=70, PETRI_TRANSITIONS=88} [2020-10-16 04:57:34,956 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2020-10-16 04:57:34,956 INFO L481 AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 939 flow [2020-10-16 04:57:34,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:34,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:34,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:34,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:57:34,957 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:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:34,957 INFO L82 PathProgramCache]: Analyzing trace with hash -650729575, now seen corresponding path program 3 times [2020-10-16 04:57:34,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:34,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666444747] [2020-10-16 04:57:34,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:35,189 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,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666444747] [2020-10-16 04:57:35,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:35,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:35,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022330370] [2020-10-16 04:57:35,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:35,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:35,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:35,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:35,193 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2020-10-16 04:57:35,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 939 flow. Second operand 9 states. [2020-10-16 04:57:35,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:35,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2020-10-16 04:57:35,195 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:35,762 INFO L129 PetriNetUnfolder]: 122/296 cut-off events. [2020-10-16 04:57:35,763 INFO L130 PetriNetUnfolder]: For 1386/1398 co-relation queries the response was YES. [2020-10-16 04:57:35,764 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 296 events. 122/296 cut-off events. For 1386/1398 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1578 event pairs, 8 based on Foata normal form. 10/305 useless extension candidates. Maximal degree in co-relation 1701. Up to 134 conditions per place. [2020-10-16 04:57:35,767 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 66 selfloop transitions, 31 changer transitions 11/116 dead transitions. [2020-10-16 04:57:35,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 1451 flow [2020-10-16 04:57:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 04:57:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 04:57:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1056 transitions. [2020-10-16 04:57:35,772 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5906040268456376 [2020-10-16 04:57:35,772 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1056 transitions. [2020-10-16 04:57:35,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1056 transitions. [2020-10-16 04:57:35,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:35,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1056 transitions. [2020-10-16 04:57:35,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 04:57:35,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 04:57:35,779 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 04:57:35,779 INFO L185 Difference]: Start difference. First operand has 70 places, 88 transitions, 939 flow. Second operand 12 states and 1056 transitions. [2020-10-16 04:57:35,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 1451 flow [2020-10-16 04:57:35,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 1432 flow, removed 9 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:35,792 INFO L241 Difference]: Finished difference. Result has 85 places, 98 transitions, 1191 flow [2020-10-16 04:57:35,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1191, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2020-10-16 04:57:35,793 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2020-10-16 04:57:35,793 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 1191 flow [2020-10-16 04:57:35,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:35,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:35,793 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:35,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:57:35,794 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:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -567612685, now seen corresponding path program 4 times [2020-10-16 04:57:35,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:35,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980595317] [2020-10-16 04:57:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:35,909 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,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980595317] [2020-10-16 04:57:35,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:35,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:35,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510518712] [2020-10-16 04:57:35,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:57:35,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:57:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:57:35,912 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 149 [2020-10-16 04:57:35,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 1191 flow. Second operand 6 states. [2020-10-16 04:57:35,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:35,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 149 [2020-10-16 04:57:35,913 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:36,325 INFO L129 PetriNetUnfolder]: 115/282 cut-off events. [2020-10-16 04:57:36,325 INFO L130 PetriNetUnfolder]: For 1803/1810 co-relation queries the response was YES. [2020-10-16 04:57:36,327 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 282 events. 115/282 cut-off events. For 1803/1810 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1443 event pairs, 3 based on Foata normal form. 9/290 useless extension candidates. Maximal degree in co-relation 1712. Up to 144 conditions per place. [2020-10-16 04:57:36,330 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 51 selfloop transitions, 48 changer transitions 5/112 dead transitions. [2020-10-16 04:57:36,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 1531 flow [2020-10-16 04:57:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 753 transitions. [2020-10-16 04:57:36,334 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6317114093959731 [2020-10-16 04:57:36,334 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 753 transitions. [2020-10-16 04:57:36,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 753 transitions. [2020-10-16 04:57:36,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:36,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 753 transitions. [2020-10-16 04:57:36,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:36,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:36,339 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:36,339 INFO L185 Difference]: Start difference. First operand has 85 places, 98 transitions, 1191 flow. Second operand 8 states and 753 transitions. [2020-10-16 04:57:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 1531 flow [2020-10-16 04:57:36,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 112 transitions, 1488 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:36,354 INFO L241 Difference]: Finished difference. Result has 85 places, 103 transitions, 1367 flow [2020-10-16 04:57:36,354 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1367, PETRI_PLACES=85, PETRI_TRANSITIONS=103} [2020-10-16 04:57:36,354 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2020-10-16 04:57:36,354 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 1367 flow [2020-10-16 04:57:36,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:57:36,355 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:36,355 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:36,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:57:36,355 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:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1039491680, now seen corresponding path program 2 times [2020-10-16 04:57:36,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:36,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129771] [2020-10-16 04:57:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:36,672 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 26 [2020-10-16 04:57:36,713 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,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129771] [2020-10-16 04:57:36,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:36,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:36,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916011105] [2020-10-16 04:57:36,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:36,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:36,716 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 04:57:36,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 1367 flow. Second operand 7 states. [2020-10-16 04:57:36,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:36,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 04:57:36,717 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:37,191 INFO L129 PetriNetUnfolder]: 111/281 cut-off events. [2020-10-16 04:57:37,192 INFO L130 PetriNetUnfolder]: For 2214/2226 co-relation queries the response was YES. [2020-10-16 04:57:37,194 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 281 events. 111/281 cut-off events. For 2214/2226 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1507 event pairs, 6 based on Foata normal form. 12/293 useless extension candidates. Maximal degree in co-relation 1855. Up to 152 conditions per place. [2020-10-16 04:57:37,197 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 54 selfloop transitions, 38 changer transitions 12/112 dead transitions. [2020-10-16 04:57:37,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 112 transitions, 1666 flow [2020-10-16 04:57:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 717 transitions. [2020-10-16 04:57:37,201 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6015100671140939 [2020-10-16 04:57:37,201 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 717 transitions. [2020-10-16 04:57:37,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 717 transitions. [2020-10-16 04:57:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:37,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 717 transitions. [2020-10-16 04:57:37,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:37,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:37,207 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:37,208 INFO L185 Difference]: Start difference. First operand has 85 places, 103 transitions, 1367 flow. Second operand 8 states and 717 transitions. [2020-10-16 04:57:37,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 112 transitions, 1666 flow [2020-10-16 04:57:37,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 112 transitions, 1610 flow, removed 21 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:37,235 INFO L241 Difference]: Finished difference. Result has 88 places, 96 transitions, 1344 flow [2020-10-16 04:57:37,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1344, PETRI_PLACES=88, PETRI_TRANSITIONS=96} [2020-10-16 04:57:37,236 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 61 predicate places. [2020-10-16 04:57:37,236 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 96 transitions, 1344 flow [2020-10-16 04:57:37,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:37,236 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:37,237 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,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:57:37,237 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:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1821489559, now seen corresponding path program 1 times [2020-10-16 04:57:37,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:37,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43566209] [2020-10-16 04:57:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:37,710 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,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43566209] [2020-10-16 04:57:37,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:37,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:37,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948535311] [2020-10-16 04:57:37,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:37,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:37,715 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 149 [2020-10-16 04:57:37,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 96 transitions, 1344 flow. Second operand 10 states. [2020-10-16 04:57:37,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:37,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 149 [2020-10-16 04:57:37,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:38,149 INFO L129 PetriNetUnfolder]: 120/336 cut-off events. [2020-10-16 04:57:38,150 INFO L130 PetriNetUnfolder]: For 3310/3322 co-relation queries the response was YES. [2020-10-16 04:57:38,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 336 events. 120/336 cut-off events. For 3310/3322 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2067 event pairs, 10 based on Foata normal form. 10/346 useless extension candidates. Maximal degree in co-relation 2256. Up to 148 conditions per place. [2020-10-16 04:57:38,155 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 71 selfloop transitions, 12 changer transitions 46/137 dead transitions. [2020-10-16 04:57:38,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 137 transitions, 2161 flow [2020-10-16 04:57:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 627 transitions. [2020-10-16 04:57:38,158 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6011505273250239 [2020-10-16 04:57:38,158 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 627 transitions. [2020-10-16 04:57:38,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 627 transitions. [2020-10-16 04:57:38,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:38,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 627 transitions. [2020-10-16 04:57:38,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:38,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:38,163 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:38,164 INFO L185 Difference]: Start difference. First operand has 88 places, 96 transitions, 1344 flow. Second operand 7 states and 627 transitions. [2020-10-16 04:57:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 137 transitions, 2161 flow [2020-10-16 04:57:38,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 2094 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:38,187 INFO L241 Difference]: Finished difference. Result has 90 places, 86 transitions, 1204 flow [2020-10-16 04:57:38,187 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1204, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2020-10-16 04:57:38,187 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 63 predicate places. [2020-10-16 04:57:38,188 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 1204 flow [2020-10-16 04:57:38,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:38,188 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:38,188 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,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:57:38,188 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:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash -235207721, now seen corresponding path program 2 times [2020-10-16 04:57:38,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:38,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536538088] [2020-10-16 04:57:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:38,561 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,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536538088] [2020-10-16 04:57:38,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:38,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:38,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053118656] [2020-10-16 04:57:38,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:38,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:38,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:38,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 149 [2020-10-16 04:57:38,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 1204 flow. Second operand 10 states. [2020-10-16 04:57:38,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:38,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 149 [2020-10-16 04:57:38,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:39,131 INFO L129 PetriNetUnfolder]: 72/237 cut-off events. [2020-10-16 04:57:39,131 INFO L130 PetriNetUnfolder]: For 2263/2272 co-relation queries the response was YES. [2020-10-16 04:57:39,133 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 237 events. 72/237 cut-off events. For 2263/2272 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1350 event pairs, 4 based on Foata normal form. 9/246 useless extension candidates. Maximal degree in co-relation 1591. Up to 134 conditions per place. [2020-10-16 04:57:39,135 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 51 selfloop transitions, 32 changer transitions 21/111 dead transitions. [2020-10-16 04:57:39,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 1740 flow [2020-10-16 04:57:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 04:57:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 04:57:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1102 transitions. [2020-10-16 04:57:39,140 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.568921011874032 [2020-10-16 04:57:39,140 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1102 transitions. [2020-10-16 04:57:39,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1102 transitions. [2020-10-16 04:57:39,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:39,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1102 transitions. [2020-10-16 04:57:39,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 04:57:39,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 04:57:39,147 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 04:57:39,147 INFO L185 Difference]: Start difference. First operand has 90 places, 86 transitions, 1204 flow. Second operand 13 states and 1102 transitions. [2020-10-16 04:57:39,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 1740 flow [2020-10-16 04:57:39,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 111 transitions, 1670 flow, removed 16 selfloop flow, removed 9 redundant places. [2020-10-16 04:57:39,163 INFO L241 Difference]: Finished difference. Result has 98 places, 89 transitions, 1341 flow [2020-10-16 04:57:39,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1341, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2020-10-16 04:57:39,164 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 71 predicate places. [2020-10-16 04:57:39,164 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 1341 flow [2020-10-16 04:57:39,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:39,164 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:39,164 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,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:57:39,164 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:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:39,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1820188551, now seen corresponding path program 3 times [2020-10-16 04:57:39,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:39,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075054409] [2020-10-16 04:57:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:39,396 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,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075054409] [2020-10-16 04:57:39,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:39,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:39,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701718825] [2020-10-16 04:57:39,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:39,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:39,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:39,400 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 04:57:39,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 1341 flow. Second operand 9 states. [2020-10-16 04:57:39,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:39,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 04:57:39,401 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:39,649 INFO L129 PetriNetUnfolder]: 64/209 cut-off events. [2020-10-16 04:57:39,650 INFO L130 PetriNetUnfolder]: For 2152/2157 co-relation queries the response was YES. [2020-10-16 04:57:39,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 209 events. 64/209 cut-off events. For 2152/2157 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1129 event pairs, 4 based on Foata normal form. 5/214 useless extension candidates. Maximal degree in co-relation 1498. Up to 148 conditions per place. [2020-10-16 04:57:39,653 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 68 selfloop transitions, 9 changer transitions 12/96 dead transitions. [2020-10-16 04:57:39,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 1603 flow [2020-10-16 04:57:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:57:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:57:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 628 transitions. [2020-10-16 04:57:39,655 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6021093000958773 [2020-10-16 04:57:39,655 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 628 transitions. [2020-10-16 04:57:39,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 628 transitions. [2020-10-16 04:57:39,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:39,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 628 transitions. [2020-10-16 04:57:39,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:57:39,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:57:39,659 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:57:39,659 INFO L185 Difference]: Start difference. First operand has 98 places, 89 transitions, 1341 flow. Second operand 7 states and 628 transitions. [2020-10-16 04:57:39,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 1603 flow [2020-10-16 04:57:39,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 1545 flow, removed 17 selfloop flow, removed 8 redundant places. [2020-10-16 04:57:39,675 INFO L241 Difference]: Finished difference. Result has 91 places, 84 transitions, 1209 flow [2020-10-16 04:57:39,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1209, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2020-10-16 04:57:39,676 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 64 predicate places. [2020-10-16 04:57:39,677 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 1209 flow [2020-10-16 04:57:39,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:39,677 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:39,677 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,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:57:39,677 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:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:39,678 INFO L82 PathProgramCache]: Analyzing trace with hash 418245925, now seen corresponding path program 4 times [2020-10-16 04:57:39,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:39,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164185013] [2020-10-16 04:57:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:40,252 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2020-10-16 04:57:40,311 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,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164185013] [2020-10-16 04:57:40,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:40,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:40,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836523414] [2020-10-16 04:57:40,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:40,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:40,315 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 149 [2020-10-16 04:57:40,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 1209 flow. Second operand 9 states. [2020-10-16 04:57:40,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:40,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 149 [2020-10-16 04:57:40,316 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:41,054 INFO L129 PetriNetUnfolder]: 62/197 cut-off events. [2020-10-16 04:57:41,054 INFO L130 PetriNetUnfolder]: For 1977/1993 co-relation queries the response was YES. [2020-10-16 04:57:41,055 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 197 events. 62/197 cut-off events. For 1977/1993 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1013 event pairs, 2 based on Foata normal form. 17/214 useless extension candidates. Maximal degree in co-relation 1330. Up to 93 conditions per place. [2020-10-16 04:57:41,057 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 28 selfloop transitions, 54 changer transitions 5/94 dead transitions. [2020-10-16 04:57:41,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 1467 flow [2020-10-16 04:57:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 04:57:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 04:57:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1159 transitions. [2020-10-16 04:57:41,066 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5556088207094918 [2020-10-16 04:57:41,066 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1159 transitions. [2020-10-16 04:57:41,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1159 transitions. [2020-10-16 04:57:41,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:41,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1159 transitions. [2020-10-16 04:57:41,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 04:57:41,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 04:57:41,077 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 04:57:41,077 INFO L185 Difference]: Start difference. First operand has 91 places, 84 transitions, 1209 flow. Second operand 14 states and 1159 transitions. [2020-10-16 04:57:41,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 1467 flow [2020-10-16 04:57:41,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 1436 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:41,090 INFO L241 Difference]: Finished difference. Result has 101 places, 85 transitions, 1321 flow [2020-10-16 04:57:41,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1321, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2020-10-16 04:57:41,091 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2020-10-16 04:57:41,091 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 1321 flow [2020-10-16 04:57:41,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:41,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:41,091 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,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:57:41,092 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:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash 418236315, now seen corresponding path program 1 times [2020-10-16 04:57:41,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:41,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137008828] [2020-10-16 04:57:41,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:41,261 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,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137008828] [2020-10-16 04:57:41,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:41,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:41,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668134585] [2020-10-16 04:57:41,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:41,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:41,264 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:41,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 1321 flow. Second operand 7 states. [2020-10-16 04:57:41,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:41,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:41,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:41,630 INFO L129 PetriNetUnfolder]: 68/210 cut-off events. [2020-10-16 04:57:41,631 INFO L130 PetriNetUnfolder]: For 2387/2392 co-relation queries the response was YES. [2020-10-16 04:57:41,632 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 210 events. 68/210 cut-off events. For 2387/2392 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1110 event pairs, 3 based on Foata normal form. 2/212 useless extension candidates. Maximal degree in co-relation 1556. Up to 88 conditions per place. [2020-10-16 04:57:41,634 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 36 selfloop transitions, 48 changer transitions 12/103 dead transitions. [2020-10-16 04:57:41,634 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 1734 flow [2020-10-16 04:57:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 730 transitions. [2020-10-16 04:57:41,637 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6124161073825504 [2020-10-16 04:57:41,637 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 730 transitions. [2020-10-16 04:57:41,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 730 transitions. [2020-10-16 04:57:41,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:41,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 730 transitions. [2020-10-16 04:57:41,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:41,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:41,640 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:41,640 INFO L185 Difference]: Start difference. First operand has 101 places, 85 transitions, 1321 flow. Second operand 8 states and 730 transitions. [2020-10-16 04:57:41,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 1734 flow [2020-10-16 04:57:41,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 103 transitions, 1524 flow, removed 28 selfloop flow, removed 13 redundant places. [2020-10-16 04:57:41,655 INFO L241 Difference]: Finished difference. Result has 96 places, 89 transitions, 1320 flow [2020-10-16 04:57:41,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1320, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2020-10-16 04:57:41,656 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2020-10-16 04:57:41,656 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 1320 flow [2020-10-16 04:57:41,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:41,656 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:41,656 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,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:57:41,656 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:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 676533895, now seen corresponding path program 5 times [2020-10-16 04:57:41,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:41,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039866198] [2020-10-16 04:57:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:41,901 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,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039866198] [2020-10-16 04:57:41,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:41,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:41,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66376212] [2020-10-16 04:57:41,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:41,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:41,906 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 149 [2020-10-16 04:57:41,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 1320 flow. Second operand 7 states. [2020-10-16 04:57:41,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:41,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 149 [2020-10-16 04:57:41,907 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:42,419 INFO L129 PetriNetUnfolder]: 65/225 cut-off events. [2020-10-16 04:57:42,419 INFO L130 PetriNetUnfolder]: For 2155/2166 co-relation queries the response was YES. [2020-10-16 04:57:42,420 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 225 events. 65/225 cut-off events. For 2155/2166 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1269 event pairs, 1 based on Foata normal form. 7/232 useless extension candidates. Maximal degree in co-relation 1612. Up to 90 conditions per place. [2020-10-16 04:57:42,421 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 47 selfloop transitions, 23 changer transitions 30/107 dead transitions. [2020-10-16 04:57:42,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 1740 flow [2020-10-16 04:57:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 817 transitions. [2020-10-16 04:57:42,423 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6092468307233407 [2020-10-16 04:57:42,423 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 817 transitions. [2020-10-16 04:57:42,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 817 transitions. [2020-10-16 04:57:42,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:42,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 817 transitions. [2020-10-16 04:57:42,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:42,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:42,427 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:42,427 INFO L185 Difference]: Start difference. First operand has 96 places, 89 transitions, 1320 flow. Second operand 9 states and 817 transitions. [2020-10-16 04:57:42,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 1740 flow [2020-10-16 04:57:42,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 107 transitions, 1692 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:42,442 INFO L241 Difference]: Finished difference. Result has 102 places, 72 transitions, 1036 flow [2020-10-16 04:57:42,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1036, PETRI_PLACES=102, PETRI_TRANSITIONS=72} [2020-10-16 04:57:42,443 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2020-10-16 04:57:42,443 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 72 transitions, 1036 flow [2020-10-16 04:57:42,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:42,443 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:42,443 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:42,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:57:42,444 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:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -959831589, now seen corresponding path program 2 times [2020-10-16 04:57:42,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:42,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519959649] [2020-10-16 04:57:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:43,038 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:43,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519959649] [2020-10-16 04:57:43,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:43,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:57:43,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007153917] [2020-10-16 04:57:43,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:57:43,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:57:43,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:57:43,042 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 149 [2020-10-16 04:57:43,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 72 transitions, 1036 flow. Second operand 11 states. [2020-10-16 04:57:43,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:43,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 149 [2020-10-16 04:57:43,043 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:43,524 INFO L129 PetriNetUnfolder]: 38/153 cut-off events. [2020-10-16 04:57:43,524 INFO L130 PetriNetUnfolder]: For 1579/1591 co-relation queries the response was YES. [2020-10-16 04:57:43,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 153 events. 38/153 cut-off events. For 1579/1591 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 756 event pairs, 4 based on Foata normal form. 8/161 useless extension candidates. Maximal degree in co-relation 1097. Up to 74 conditions per place. [2020-10-16 04:57:43,526 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 61 selfloop transitions, 16 changer transitions 2/86 dead transitions. [2020-10-16 04:57:43,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 86 transitions, 1375 flow [2020-10-16 04:57:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 778 transitions. [2020-10-16 04:57:43,528 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5801640566741237 [2020-10-16 04:57:43,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 778 transitions. [2020-10-16 04:57:43,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 778 transitions. [2020-10-16 04:57:43,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:43,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 778 transitions. [2020-10-16 04:57:43,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:43,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:43,531 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:43,531 INFO L185 Difference]: Start difference. First operand has 102 places, 72 transitions, 1036 flow. Second operand 9 states and 778 transitions. [2020-10-16 04:57:43,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 86 transitions, 1375 flow [2020-10-16 04:57:43,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 86 transitions, 1284 flow, removed 16 selfloop flow, removed 10 redundant places. [2020-10-16 04:57:43,543 INFO L241 Difference]: Finished difference. Result has 102 places, 75 transitions, 1041 flow [2020-10-16 04:57:43,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1041, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2020-10-16 04:57:43,544 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 75 predicate places. [2020-10-16 04:57:43,544 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 1041 flow [2020-10-16 04:57:43,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:57:43,544 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:43,545 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:43,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:57:43,545 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:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1927605871, now seen corresponding path program 3 times [2020-10-16 04:57:43,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:43,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293259896] [2020-10-16 04:57:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:57:43,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293259896] [2020-10-16 04:57:43,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:43,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:43,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778015154] [2020-10-16 04:57:43,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:43,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:43,854 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2020-10-16 04:57:43,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 1041 flow. Second operand 10 states. [2020-10-16 04:57:43,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:43,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2020-10-16 04:57:43,855 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:44,395 INFO L129 PetriNetUnfolder]: 37/146 cut-off events. [2020-10-16 04:57:44,396 INFO L130 PetriNetUnfolder]: For 1443/1451 co-relation queries the response was YES. [2020-10-16 04:57:44,396 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 146 events. 37/146 cut-off events. For 1443/1451 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 705 event pairs, 1 based on Foata normal form. 3/149 useless extension candidates. Maximal degree in co-relation 1049. Up to 58 conditions per place. [2020-10-16 04:57:44,398 INFO L132 encePairwiseOnDemand]: 141/149 looper letters, 20 selfloop transitions, 12 changer transitions 51/90 dead transitions. [2020-10-16 04:57:44,398 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 90 transitions, 1415 flow [2020-10-16 04:57:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 789 transitions. [2020-10-16 04:57:44,401 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5883668903803132 [2020-10-16 04:57:44,401 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 789 transitions. [2020-10-16 04:57:44,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 789 transitions. [2020-10-16 04:57:44,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:44,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 789 transitions. [2020-10-16 04:57:44,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:44,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:44,404 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:44,404 INFO L185 Difference]: Start difference. First operand has 102 places, 75 transitions, 1041 flow. Second operand 9 states and 789 transitions. [2020-10-16 04:57:44,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 90 transitions, 1415 flow [2020-10-16 04:57:44,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 90 transitions, 1359 flow, removed 18 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:44,415 INFO L241 Difference]: Finished difference. Result has 105 places, 37 transitions, 497 flow [2020-10-16 04:57:44,416 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=497, PETRI_PLACES=105, PETRI_TRANSITIONS=37} [2020-10-16 04:57:44,416 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2020-10-16 04:57:44,416 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 37 transitions, 497 flow [2020-10-16 04:57:44,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:44,416 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:44,417 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:44,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 04:57:44,417 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:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash 151379857, now seen corresponding path program 6 times [2020-10-16 04:57:44,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:44,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139325962] [2020-10-16 04:57:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:44,549 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:44,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139325962] [2020-10-16 04:57:44,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:44,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:44,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815447690] [2020-10-16 04:57:44,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:44,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:44,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:44,552 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 149 [2020-10-16 04:57:44,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 37 transitions, 497 flow. Second operand 7 states. [2020-10-16 04:57:44,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:44,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 149 [2020-10-16 04:57:44,553 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:44,703 INFO L129 PetriNetUnfolder]: 12/53 cut-off events. [2020-10-16 04:57:44,703 INFO L130 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2020-10-16 04:57:44,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 53 events. 12/53 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 1 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 384. Up to 29 conditions per place. [2020-10-16 04:57:44,704 INFO L132 encePairwiseOnDemand]: 144/149 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2020-10-16 04:57:44,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 37 transitions, 555 flow [2020-10-16 04:57:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:57:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:57:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2020-10-16 04:57:44,707 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6387024608501118 [2020-10-16 04:57:44,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2020-10-16 04:57:44,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2020-10-16 04:57:44,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:44,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2020-10-16 04:57:44,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:57:44,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:57:44,714 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:57:44,715 INFO L185 Difference]: Start difference. First operand has 105 places, 37 transitions, 497 flow. Second operand 6 states and 571 transitions. [2020-10-16 04:57:44,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 37 transitions, 555 flow [2020-10-16 04:57:44,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 37 transitions, 333 flow, removed 27 selfloop flow, removed 34 redundant places. [2020-10-16 04:57:44,722 INFO L241 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2020-10-16 04:57:44,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2020-10-16 04:57:44,723 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2020-10-16 04:57:44,723 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2020-10-16 04:57:44,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:44,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 04:57:44,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:57:44 BasicIcfg [2020-10-16 04:57:44,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:57:44,744 INFO L168 Benchmark]: Toolchain (without parser) took 24386.63 ms. Allocated memory was 249.6 MB in the beginning and 799.0 MB in the end (delta: 549.5 MB). Free memory was 201.2 MB in the beginning and 281.0 MB in the end (delta: -79.8 MB). Peak memory consumption was 469.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:44,745 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 249.6 MB. Free memory is still 223.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:57:44,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.59 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 201.2 MB in the beginning and 258.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:44,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 309.9 MB. Free memory was 258.0 MB in the beginning and 252.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:44,750 INFO L168 Benchmark]: Boogie Preprocessor took 47.76 ms. Allocated memory is still 309.9 MB. Free memory was 252.9 MB in the beginning and 250.4 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:44,751 INFO L168 Benchmark]: RCFGBuilder took 3698.24 ms. Allocated memory was 309.9 MB in the beginning and 370.1 MB in the end (delta: 60.3 MB). Free memory was 250.4 MB in the beginning and 162.9 MB in the end (delta: 87.5 MB). Peak memory consumption was 147.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:44,755 INFO L168 Benchmark]: TraceAbstraction took 19749.20 ms. Allocated memory was 370.1 MB in the beginning and 799.0 MB in the end (delta: 428.9 MB). Free memory was 162.9 MB in the beginning and 281.0 MB in the end (delta: -118.1 MB). Peak memory consumption was 310.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:44,761 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.21 ms. Allocated memory is still 249.6 MB. Free memory is still 223.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 810.59 ms. Allocated memory was 249.6 MB in the beginning and 309.9 MB in the end (delta: 60.3 MB). Free memory was 201.2 MB in the beginning and 258.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 29.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.20 ms. Allocated memory is still 309.9 MB. Free memory was 258.0 MB in the beginning and 252.9 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.76 ms. Allocated memory is still 309.9 MB. Free memory was 252.9 MB in the beginning and 250.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3698.24 ms. Allocated memory was 309.9 MB in the beginning and 370.1 MB in the end (delta: 60.3 MB). Free memory was 250.4 MB in the beginning and 162.9 MB in the end (delta: 87.5 MB). Peak memory consumption was 147.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19749.20 ms. Allocated memory was 370.1 MB in the beginning and 799.0 MB in the end (delta: 428.9 MB). Free memory was 162.9 MB in the beginning and 281.0 MB in the end (delta: -118.1 MB). Peak memory consumption was 310.8 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.3s, 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: 19.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 128 SDtfs, 191 SDslu, 193 SDs, 0 SdLazy, 1603 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1367occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 47417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...