/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/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:24:06,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:24:06,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:24:06,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:24:06,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:24:06,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:24:06,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:24:06,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:24:06,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:24:06,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:24:06,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:24:06,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:24:06,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:24:06,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:24:06,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:24:06,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:24:06,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:24:06,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:24:06,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:24:06,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:24:06,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:24:06,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:24:06,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:24:06,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:24:06,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:24:06,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:24:06,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:24:06,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:24:06,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:24:06,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:24:06,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:24:06,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:24:06,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:24:06,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:24:06,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:24:06,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:24:06,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:24:06,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:24:06,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:24:06,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:24:06,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:24:06,898 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 05:24:06,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:24:06,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:24:06,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:24:06,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:24:06,934 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:24:06,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:24:06,934 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:24:06,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:24:06,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:24:06,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:24:06,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:24:06,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:24:06,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:24:06,936 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:24:06,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:24:06,937 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:24:06,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:24:06,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:24:06,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:24:06,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:24:06,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:24:06,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:24:06,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:24:06,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:24:07,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:24:07,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:24:07,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:24:07,256 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:24:07,256 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:24:07,257 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-16 05:24:07,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c633bbf60/11fe6c9ea4b74d49bdf9dcd1f81cdcfe/FLAGacb33ac1f [2020-10-16 05:24:07,896 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:24:07,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2020-10-16 05:24:07,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c633bbf60/11fe6c9ea4b74d49bdf9dcd1f81cdcfe/FLAGacb33ac1f [2020-10-16 05:24:08,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c633bbf60/11fe6c9ea4b74d49bdf9dcd1f81cdcfe [2020-10-16 05:24:08,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:24:08,130 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:24:08,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:24:08,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:24:08,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:24:08,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:24:08" (1/1) ... [2020-10-16 05:24:08,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa85c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:08, skipping insertion in model container [2020-10-16 05:24:08,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:24:08" (1/1) ... [2020-10-16 05:24:08,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:24:08,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:24:08,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:24:08,962 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:24:09,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:24:09,393 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:24:09,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09 WrapperNode [2020-10-16 05:24:09,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:24:09,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:24:09,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:24:09,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:24:09,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:24:09,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:24:09,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:24:09,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:24:09,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (1/1) ... [2020-10-16 05:24:09,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:24:09,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:24:09,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:24:09,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:24:09,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (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 05:24:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:24:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 05:24:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-16 05:24:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-16 05:24:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:24:09,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:24:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-16 05:24:09,597 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-16 05:24:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:24:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:24:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 05:24:09,599 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 05:24:10,157 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:24:10,158 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-16 05:24:10,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:24:10 BoogieIcfgContainer [2020-10-16 05:24:10,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:24:10,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:24:10,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:24:10,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:24:10,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:24:08" (1/3) ... [2020-10-16 05:24:10,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db22194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:24:10, skipping insertion in model container [2020-10-16 05:24:10,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:24:09" (2/3) ... [2020-10-16 05:24:10,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db22194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:24:10, skipping insertion in model container [2020-10-16 05:24:10,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:24:10" (3/3) ... [2020-10-16 05:24:10,168 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2020-10-16 05:24:10,178 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:24:10,186 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-16 05:24:10,187 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:24:10,218 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,218 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,222 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,222 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,222 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,223 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,223 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,224 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,224 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,225 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,225 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,225 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,227 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,228 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,229 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,229 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,229 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,229 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,229 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,230 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,230 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,230 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,230 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,231 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,231 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,232 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,232 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,232 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,232 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,236 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,236 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,236 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,236 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,237 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,237 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,238 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,245 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,245 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,245 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,245 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,246 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,246 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,246 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,246 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,246 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,247 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,247 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,247 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:24:10,270 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-16 05:24:10,289 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:24:10,289 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:24:10,289 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:24:10,289 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:24:10,289 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:24:10,290 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:24:10,290 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:24:10,290 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:24:10,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 151 places, 155 transitions, 332 flow [2020-10-16 05:24:10,374 INFO L129 PetriNetUnfolder]: 11/193 cut-off events. [2020-10-16 05:24:10,375 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:24:10,381 INFO L80 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 193 events. 11/193 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-16 05:24:10,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 155 transitions, 332 flow [2020-10-16 05:24:10,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 144 transitions, 306 flow [2020-10-16 05:24:10,391 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:24:10,394 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 144 transitions, 306 flow [2020-10-16 05:24:10,396 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 144 transitions, 306 flow [2020-10-16 05:24:10,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 142 places, 144 transitions, 306 flow [2020-10-16 05:24:10,434 INFO L129 PetriNetUnfolder]: 8/176 cut-off events. [2020-10-16 05:24:10,435 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:24:10,436 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 176 events. 8/176 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2020-10-16 05:24:10,439 INFO L117 LiptonReduction]: Number of co-enabled transitions 2436 [2020-10-16 05:24:10,570 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,597 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:10,602 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,622 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:10,624 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:24:10,640 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:10,669 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:10,690 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:10,691 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:24:12,796 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,822 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:12,827 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,851 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:12,852 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,852 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:12,867 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,893 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:12,898 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:12,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:12,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:15,177 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,242 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:15,246 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:15,268 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,269 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:15,282 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,306 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:15,311 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:15,332 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:15,332 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:17,406 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:17,436 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,458 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:17,459 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,459 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:24:17,475 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:17,504 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:17,528 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:17,528 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:24:19,608 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,632 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:19,636 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:19,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,661 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 05:24:19,680 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:19,712 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,735 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:19,736 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:19,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:24:21,861 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:21,885 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:21,904 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,905 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:21,922 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,942 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:21,945 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,960 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:21,961 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:21,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:24,362 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:24,397 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,416 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:24,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,418 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:24,435 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:24,465 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:24,484 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:24,484 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:24:26,523 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,552 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:26,556 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:26,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,577 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:26,590 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,610 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:26,614 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,636 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:26,637 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:26,638 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:28,656 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:28,682 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:28,698 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,699 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:28,707 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,727 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:28,731 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:28,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:28,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:30,867 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:30,906 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:30,930 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:30,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:30,951 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:30,951 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:30,959 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:30,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:30,986 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:31,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:31,010 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:31,011 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:24:33,220 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,246 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:33,249 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:33,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,271 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-16 05:24:33,284 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:33,316 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:33,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:33,340 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:35,444 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:35,472 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:35,495 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,496 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:35,505 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:35,533 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:35,557 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:35,557 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:37,781 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,807 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,824 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,825 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,825 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 05:24:37,836 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,856 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,860 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,885 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,885 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:24:37,907 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,927 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,931 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,946 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,946 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:24:37,958 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,978 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:37,993 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:37,993 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-16 05:24:40,036 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,067 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:40,070 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,101 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:40,103 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,103 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:40,111 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:40,137 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:40,161 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:40,162 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:42,216 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,241 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:42,244 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,262 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:42,263 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,263 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:42,276 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,297 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:42,300 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:42,320 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:42,320 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:44,405 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,427 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:44,430 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:44,454 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,455 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:44,469 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:44,498 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,517 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:44,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:44,518 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:46,585 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:46,607 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:46,624 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,624 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:24:46,641 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:46,666 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:46,685 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:46,686 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:48,800 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:48,832 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:48,865 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,868 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:48,891 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,929 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:48,934 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:48,968 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:48,968 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:24:51,026 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,046 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,064 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,065 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-16 05:24:51,269 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2020-10-16 05:24:51,277 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,333 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,370 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,371 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,371 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:104 [2020-10-16 05:24:51,517 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,547 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,566 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,567 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,567 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:51,590 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,618 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,627 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,653 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:51,654 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:51,654 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:53,767 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,785 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:53,789 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,804 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:53,805 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,805 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:24:53,814 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:53,833 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:53,849 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:53,850 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-16 05:24:55,911 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:55,930 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:55,933 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:55,957 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:55,958 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:55,959 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:55,967 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:55,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:55,988 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:56,010 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:56,011 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:56,012 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-16 05:24:58,041 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,066 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:58,069 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:58,087 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:24:58,094 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,111 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:58,114 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:24:58,128 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:24:58,128 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-16 05:25:00,155 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,173 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:00,177 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:00,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-16 05:25:00,206 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:00,234 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:00,251 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:00,252 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-16 05:25:03,019 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:03,042 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,056 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:03,057 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,058 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-16 05:25:03,067 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,086 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:03,088 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:03,104 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:03,104 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-16 05:25:05,313 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-10-16 05:25:05,747 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-10-16 05:25:06,071 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 05:25:06,228 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 05:25:07,208 WARN L193 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2020-10-16 05:25:07,240 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:07,666 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:25:07,667 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:07,678 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:08,084 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:25:08,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-16 05:25:08,085 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-16 05:25:08,085 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:267, output treesize:279 [2020-10-16 05:25:08,505 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:25:08,993 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 128 [2020-10-16 05:25:09,203 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-16 05:25:09,213 INFO L132 LiptonReduction]: Checked pairs total: 5917 [2020-10-16 05:25:09,214 INFO L134 LiptonReduction]: Total number of compositions: 152 [2020-10-16 05:25:09,216 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58827 [2020-10-16 05:25:09,221 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 05:25:09,222 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:25:09,222 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:09,222 INFO L255 CegarLoopForPetriNet]: trace histogram [1] [2020-10-16 05:25:09,223 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 544, now seen corresponding path program 1 times [2020-10-16 05:25:09,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:09,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242115124] [2020-10-16 05:25:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:09,485 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 05:25:09,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242115124] [2020-10-16 05:25:09,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:09,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-16 05:25:09,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275286928] [2020-10-16 05:25:09,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 05:25:09,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 05:25:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 05:25:09,511 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2020-10-16 05:25:09,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 88 flow. Second operand 2 states. [2020-10-16 05:25:09,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:09,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2020-10-16 05:25:09,515 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:09,528 INFO L129 PetriNetUnfolder]: 2/40 cut-off events. [2020-10-16 05:25:09,528 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:25:09,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 2/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 3/36 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2020-10-16 05:25:09,530 INFO L132 encePairwiseOnDemand]: 304/307 looper letters, 0 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2020-10-16 05:25:09,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 82 flow [2020-10-16 05:25:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 05:25:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 05:25:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 559 transitions. [2020-10-16 05:25:09,547 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9104234527687296 [2020-10-16 05:25:09,548 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 559 transitions. [2020-10-16 05:25:09,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 559 transitions. [2020-10-16 05:25:09,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:09,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 559 transitions. [2020-10-16 05:25:09,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 05:25:09,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 05:25:09,566 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 05:25:09,568 INFO L185 Difference]: Start difference. First operand has 37 places, 35 transitions, 88 flow. Second operand 2 states and 559 transitions. [2020-10-16 05:25:09,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 82 flow [2020-10-16 05:25:09,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 70 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 05:25:09,574 INFO L241 Difference]: Finished difference. Result has 32 places, 32 transitions, 70 flow [2020-10-16 05:25:09,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2020-10-16 05:25:09,577 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2020-10-16 05:25:09,578 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 70 flow [2020-10-16 05:25:09,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 05:25:09,578 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:09,578 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2020-10-16 05:25:09,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:25:09,579 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash 16702116, now seen corresponding path program 1 times [2020-10-16 05:25:09,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:09,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052186693] [2020-10-16 05:25:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:09,735 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 05:25:09,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052186693] [2020-10-16 05:25:09,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:09,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:25:09,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164508676] [2020-10-16 05:25:09,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:25:09,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:25:09,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:25:09,740 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 307 [2020-10-16 05:25:09,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 70 flow. Second operand 3 states. [2020-10-16 05:25:09,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:09,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 307 [2020-10-16 05:25:09,741 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:09,899 INFO L129 PetriNetUnfolder]: 241/492 cut-off events. [2020-10-16 05:25:09,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:25:09,901 INFO L80 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 492 events. 241/492 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2480 event pairs, 98 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 935. Up to 325 conditions per place. [2020-10-16 05:25:09,905 INFO L132 encePairwiseOnDemand]: 299/307 looper letters, 23 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2020-10-16 05:25:09,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 148 flow [2020-10-16 05:25:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:25:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:25:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2020-10-16 05:25:09,908 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6525515743756786 [2020-10-16 05:25:09,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 601 transitions. [2020-10-16 05:25:09,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 601 transitions. [2020-10-16 05:25:09,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:09,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 601 transitions. [2020-10-16 05:25:09,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:25:09,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:25:09,913 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:25:09,914 INFO L185 Difference]: Start difference. First operand has 32 places, 32 transitions, 70 flow. Second operand 3 states and 601 transitions. [2020-10-16 05:25:09,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 148 flow [2020-10-16 05:25:09,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:25:09,916 INFO L241 Difference]: Finished difference. Result has 36 places, 37 transitions, 120 flow [2020-10-16 05:25:09,916 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2020-10-16 05:25:09,917 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2020-10-16 05:25:09,917 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 120 flow [2020-10-16 05:25:09,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:25:09,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:09,917 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:25:09,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:25:09,918 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 517765959, now seen corresponding path program 1 times [2020-10-16 05:25:09,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:09,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152724884] [2020-10-16 05:25:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:09,977 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 05:25:09,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152724884] [2020-10-16 05:25:09,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:09,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:25:09,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835309951] [2020-10-16 05:25:09,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:25:09,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:09,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:25:09,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:25:09,980 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 307 [2020-10-16 05:25:09,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 120 flow. Second operand 3 states. [2020-10-16 05:25:09,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:09,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 307 [2020-10-16 05:25:09,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:10,138 INFO L129 PetriNetUnfolder]: 290/578 cut-off events. [2020-10-16 05:25:10,138 INFO L130 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2020-10-16 05:25:10,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1553 conditions, 578 events. 290/578 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3025 event pairs, 127 based on Foata normal form. 17/589 useless extension candidates. Maximal degree in co-relation 1548. Up to 421 conditions per place. [2020-10-16 05:25:10,143 INFO L132 encePairwiseOnDemand]: 300/307 looper letters, 27 selfloop transitions, 9 changer transitions 2/49 dead transitions. [2020-10-16 05:25:10,143 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 250 flow [2020-10-16 05:25:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:25:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:25:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2020-10-16 05:25:10,146 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6514657980456026 [2020-10-16 05:25:10,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 600 transitions. [2020-10-16 05:25:10,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 600 transitions. [2020-10-16 05:25:10,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:10,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 600 transitions. [2020-10-16 05:25:10,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:25:10,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:25:10,150 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:25:10,150 INFO L185 Difference]: Start difference. First operand has 36 places, 37 transitions, 120 flow. Second operand 3 states and 600 transitions. [2020-10-16 05:25:10,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 250 flow [2020-10-16 05:25:10,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:25:10,154 INFO L241 Difference]: Finished difference. Result has 37 places, 43 transitions, 177 flow [2020-10-16 05:25:10,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=37, PETRI_TRANSITIONS=43} [2020-10-16 05:25:10,155 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2020-10-16 05:25:10,155 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 43 transitions, 177 flow [2020-10-16 05:25:10,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:25:10,155 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:10,155 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:10,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:25:10,156 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1502005243, now seen corresponding path program 1 times [2020-10-16 05:25:10,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:10,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063471509] [2020-10-16 05:25:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:10,216 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 05:25:10,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063471509] [2020-10-16 05:25:10,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:10,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:25:10,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486492273] [2020-10-16 05:25:10,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:25:10,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:25:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:25:10,219 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 307 [2020-10-16 05:25:10,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 43 transitions, 177 flow. Second operand 3 states. [2020-10-16 05:25:10,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:10,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 307 [2020-10-16 05:25:10,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:10,239 INFO L129 PetriNetUnfolder]: 5/45 cut-off events. [2020-10-16 05:25:10,239 INFO L130 PetriNetUnfolder]: For 14/28 co-relation queries the response was YES. [2020-10-16 05:25:10,239 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 45 events. 5/45 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 4 based on Foata normal form. 15/58 useless extension candidates. Maximal degree in co-relation 74. Up to 13 conditions per place. [2020-10-16 05:25:10,240 INFO L132 encePairwiseOnDemand]: 305/307 looper letters, 2 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2020-10-16 05:25:10,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 78 flow [2020-10-16 05:25:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:25:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:25:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2020-10-16 05:25:10,243 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8284473398479913 [2020-10-16 05:25:10,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 763 transitions. [2020-10-16 05:25:10,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 763 transitions. [2020-10-16 05:25:10,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:10,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 763 transitions. [2020-10-16 05:25:10,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:25:10,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:25:10,247 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:25:10,247 INFO L185 Difference]: Start difference. First operand has 37 places, 43 transitions, 177 flow. Second operand 3 states and 763 transitions. [2020-10-16 05:25:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 78 flow [2020-10-16 05:25:10,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 70 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 05:25:10,249 INFO L241 Difference]: Finished difference. Result has 31 places, 25 transitions, 66 flow [2020-10-16 05:25:10,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2020-10-16 05:25:10,249 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2020-10-16 05:25:10,249 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 66 flow [2020-10-16 05:25:10,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:25:10,250 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:10,250 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:10,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:25:10,250 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1377964766, now seen corresponding path program 1 times [2020-10-16 05:25:10,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:10,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927054141] [2020-10-16 05:25:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:10,425 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 05:25:10,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927054141] [2020-10-16 05:25:10,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:10,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:25:10,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877365248] [2020-10-16 05:25:10,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:25:10,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:25:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:25:10,429 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 307 [2020-10-16 05:25:10,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 66 flow. Second operand 6 states. [2020-10-16 05:25:10,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:10,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 307 [2020-10-16 05:25:10,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:10,545 INFO L129 PetriNetUnfolder]: 4/46 cut-off events. [2020-10-16 05:25:10,545 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:25:10,545 INFO L80 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 46 events. 4/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 75. Up to 9 conditions per place. [2020-10-16 05:25:10,545 INFO L132 encePairwiseOnDemand]: 300/307 looper letters, 0 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2020-10-16 05:25:10,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 93 flow [2020-10-16 05:25:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:25:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:25:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1741 transitions. [2020-10-16 05:25:10,552 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8101442531409958 [2020-10-16 05:25:10,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1741 transitions. [2020-10-16 05:25:10,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1741 transitions. [2020-10-16 05:25:10,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:10,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1741 transitions. [2020-10-16 05:25:10,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:25:10,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:25:10,563 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:25:10,564 INFO L185 Difference]: Start difference. First operand has 31 places, 25 transitions, 66 flow. Second operand 7 states and 1741 transitions. [2020-10-16 05:25:10,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 93 flow [2020-10-16 05:25:10,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 84 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 05:25:10,565 INFO L241 Difference]: Finished difference. Result has 35 places, 28 transitions, 84 flow [2020-10-16 05:25:10,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2020-10-16 05:25:10,566 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2020-10-16 05:25:10,566 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 84 flow [2020-10-16 05:25:10,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:25:10,566 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:10,566 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:10,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:25:10,567 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2038101396, now seen corresponding path program 2 times [2020-10-16 05:25:10,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:10,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519363654] [2020-10-16 05:25:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:11,392 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 05:25:11,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519363654] [2020-10-16 05:25:11,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:11,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:11,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853163111] [2020-10-16 05:25:11,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:11,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:11,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:11,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:11,397 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:11,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 84 flow. Second operand 14 states. [2020-10-16 05:25:11,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:11,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:11,399 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:12,619 INFO L129 PetriNetUnfolder]: 65/186 cut-off events. [2020-10-16 05:25:12,619 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-16 05:25:12,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 186 events. 65/186 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 746 event pairs, 21 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 413. Up to 105 conditions per place. [2020-10-16 05:25:12,622 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 44 selfloop transitions, 17 changer transitions 0/66 dead transitions. [2020-10-16 05:25:12,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 298 flow [2020-10-16 05:25:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2103 transitions. [2020-10-16 05:25:12,630 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48929734760353655 [2020-10-16 05:25:12,630 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2103 transitions. [2020-10-16 05:25:12,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2103 transitions. [2020-10-16 05:25:12,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:12,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2103 transitions. [2020-10-16 05:25:12,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:12,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:12,642 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:12,642 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 84 flow. Second operand 14 states and 2103 transitions. [2020-10-16 05:25:12,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 298 flow [2020-10-16 05:25:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:25:12,645 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 200 flow [2020-10-16 05:25:12,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=200, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2020-10-16 05:25:12,646 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2020-10-16 05:25:12,646 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 200 flow [2020-10-16 05:25:12,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:12,646 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:12,647 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:12,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:25:12,647 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash 230465618, now seen corresponding path program 3 times [2020-10-16 05:25:12,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:12,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093097595] [2020-10-16 05:25:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:13,507 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 05:25:13,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093097595] [2020-10-16 05:25:13,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:13,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:13,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077387354] [2020-10-16 05:25:13,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:13,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:13,514 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:13,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 200 flow. Second operand 14 states. [2020-10-16 05:25:13,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:13,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:13,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:14,583 INFO L129 PetriNetUnfolder]: 76/225 cut-off events. [2020-10-16 05:25:14,583 INFO L130 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2020-10-16 05:25:14,584 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 225 events. 76/225 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1006 event pairs, 37 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 653. Up to 139 conditions per place. [2020-10-16 05:25:14,586 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 50 selfloop transitions, 20 changer transitions 0/75 dead transitions. [2020-10-16 05:25:14,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 460 flow [2020-10-16 05:25:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2101 transitions. [2020-10-16 05:25:14,593 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4888320148906468 [2020-10-16 05:25:14,593 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2101 transitions. [2020-10-16 05:25:14,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2101 transitions. [2020-10-16 05:25:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:14,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2101 transitions. [2020-10-16 05:25:14,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:14,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:14,606 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:14,606 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 200 flow. Second operand 14 states and 2101 transitions. [2020-10-16 05:25:14,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 460 flow [2020-10-16 05:25:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 458 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:25:14,611 INFO L241 Difference]: Finished difference. Result has 75 places, 52 transitions, 333 flow [2020-10-16 05:25:14,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2020-10-16 05:25:14,611 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2020-10-16 05:25:14,611 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 333 flow [2020-10-16 05:25:14,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:14,612 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:14,612 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:14,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:25:14,612 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1776967334, now seen corresponding path program 1 times [2020-10-16 05:25:14,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:14,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26404763] [2020-10-16 05:25:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:14,878 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 05:25:14,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26404763] [2020-10-16 05:25:14,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:14,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:25:14,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618549152] [2020-10-16 05:25:14,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:25:14,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:14,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:25:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:25:14,882 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 307 [2020-10-16 05:25:14,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 333 flow. Second operand 9 states. [2020-10-16 05:25:14,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:14,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 307 [2020-10-16 05:25:14,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:15,281 INFO L129 PetriNetUnfolder]: 83/278 cut-off events. [2020-10-16 05:25:15,281 INFO L130 PetriNetUnfolder]: For 316/317 co-relation queries the response was YES. [2020-10-16 05:25:15,283 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 278 events. 83/278 cut-off events. For 316/317 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1440 event pairs, 7 based on Foata normal form. 3/277 useless extension candidates. Maximal degree in co-relation 861. Up to 85 conditions per place. [2020-10-16 05:25:15,284 INFO L132 encePairwiseOnDemand]: 299/307 looper letters, 43 selfloop transitions, 16 changer transitions 12/81 dead transitions. [2020-10-16 05:25:15,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 621 flow [2020-10-16 05:25:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:25:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:25:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1318 transitions. [2020-10-16 05:25:15,289 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5366449511400652 [2020-10-16 05:25:15,289 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1318 transitions. [2020-10-16 05:25:15,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1318 transitions. [2020-10-16 05:25:15,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:15,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1318 transitions. [2020-10-16 05:25:15,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:25:15,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:25:15,297 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:25:15,297 INFO L185 Difference]: Start difference. First operand has 75 places, 52 transitions, 333 flow. Second operand 8 states and 1318 transitions. [2020-10-16 05:25:15,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 621 flow [2020-10-16 05:25:15,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 81 transitions, 594 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 05:25:15,303 INFO L241 Difference]: Finished difference. Result has 80 places, 45 transitions, 305 flow [2020-10-16 05:25:15,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=305, PETRI_PLACES=80, PETRI_TRANSITIONS=45} [2020-10-16 05:25:15,303 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2020-10-16 05:25:15,303 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 45 transitions, 305 flow [2020-10-16 05:25:15,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:25:15,303 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:15,304 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:15,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:25:15,304 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 653015518, now seen corresponding path program 4 times [2020-10-16 05:25:15,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:15,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972606886] [2020-10-16 05:25:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:16,058 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 05:25:16,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972606886] [2020-10-16 05:25:16,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:16,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:16,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496082051] [2020-10-16 05:25:16,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:16,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:16,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:16,063 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:16,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 45 transitions, 305 flow. Second operand 14 states. [2020-10-16 05:25:16,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:16,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:16,064 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:17,190 INFO L129 PetriNetUnfolder]: 96/285 cut-off events. [2020-10-16 05:25:17,190 INFO L130 PetriNetUnfolder]: For 579/582 co-relation queries the response was YES. [2020-10-16 05:25:17,191 INFO L80 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 285 events. 96/285 cut-off events. For 579/582 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1388 event pairs, 31 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 972. Up to 144 conditions per place. [2020-10-16 05:25:17,193 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 51 selfloop transitions, 18 changer transitions 16/90 dead transitions. [2020-10-16 05:25:17,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 90 transitions, 718 flow [2020-10-16 05:25:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1967 transitions. [2020-10-16 05:25:17,201 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4928589325983463 [2020-10-16 05:25:17,201 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1967 transitions. [2020-10-16 05:25:17,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1967 transitions. [2020-10-16 05:25:17,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:17,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1967 transitions. [2020-10-16 05:25:17,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:17,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:17,212 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:17,212 INFO L185 Difference]: Start difference. First operand has 80 places, 45 transitions, 305 flow. Second operand 13 states and 1967 transitions. [2020-10-16 05:25:17,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 90 transitions, 718 flow [2020-10-16 05:25:17,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 598 flow, removed 49 selfloop flow, removed 13 redundant places. [2020-10-16 05:25:17,218 INFO L241 Difference]: Finished difference. Result has 73 places, 51 transitions, 334 flow [2020-10-16 05:25:17,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=334, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2020-10-16 05:25:17,219 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2020-10-16 05:25:17,219 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 334 flow [2020-10-16 05:25:17,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:17,219 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:17,219 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:17,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:25:17,219 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:17,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:17,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1950805024, now seen corresponding path program 5 times [2020-10-16 05:25:17,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:17,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464458229] [2020-10-16 05:25:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:17,953 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 05:25:17,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464458229] [2020-10-16 05:25:17,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:17,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:17,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437455221] [2020-10-16 05:25:17,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:17,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:17,957 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:17,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 334 flow. Second operand 14 states. [2020-10-16 05:25:17,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:17,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:17,958 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:19,068 INFO L129 PetriNetUnfolder]: 110/325 cut-off events. [2020-10-16 05:25:19,068 INFO L130 PetriNetUnfolder]: For 567/570 co-relation queries the response was YES. [2020-10-16 05:25:19,070 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 325 events. 110/325 cut-off events. For 567/570 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1714 event pairs, 37 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 1141. Up to 203 conditions per place. [2020-10-16 05:25:19,071 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 52 selfloop transitions, 18 changer transitions 17/92 dead transitions. [2020-10-16 05:25:19,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 92 transitions, 719 flow [2020-10-16 05:25:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1964 transitions. [2020-10-16 05:25:19,081 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.49210724129290906 [2020-10-16 05:25:19,082 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1964 transitions. [2020-10-16 05:25:19,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1964 transitions. [2020-10-16 05:25:19,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:19,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1964 transitions. [2020-10-16 05:25:19,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:19,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:19,091 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:19,092 INFO L185 Difference]: Start difference. First operand has 73 places, 51 transitions, 334 flow. Second operand 13 states and 1964 transitions. [2020-10-16 05:25:19,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 92 transitions, 719 flow [2020-10-16 05:25:19,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 679 flow, removed 9 selfloop flow, removed 8 redundant places. [2020-10-16 05:25:19,098 INFO L241 Difference]: Finished difference. Result has 80 places, 57 transitions, 407 flow [2020-10-16 05:25:19,098 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=407, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2020-10-16 05:25:19,099 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2020-10-16 05:25:19,099 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 407 flow [2020-10-16 05:25:19,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:19,099 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:19,099 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:19,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:25:19,100 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1106918426, now seen corresponding path program 6 times [2020-10-16 05:25:19,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:19,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746492534] [2020-10-16 05:25:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:19,800 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 05:25:19,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746492534] [2020-10-16 05:25:19,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:19,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:19,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055171437] [2020-10-16 05:25:19,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:19,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:19,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:19,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:19,804 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:19,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 407 flow. Second operand 14 states. [2020-10-16 05:25:19,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:19,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:19,806 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:20,869 INFO L129 PetriNetUnfolder]: 105/317 cut-off events. [2020-10-16 05:25:20,869 INFO L130 PetriNetUnfolder]: For 755/757 co-relation queries the response was YES. [2020-10-16 05:25:20,871 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 317 events. 105/317 cut-off events. For 755/757 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1700 event pairs, 49 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 1200. Up to 223 conditions per place. [2020-10-16 05:25:20,872 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 45 selfloop transitions, 12 changer transitions 21/83 dead transitions. [2020-10-16 05:25:20,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 705 flow [2020-10-16 05:25:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1955 transitions. [2020-10-16 05:25:20,879 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48985216737659737 [2020-10-16 05:25:20,879 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1955 transitions. [2020-10-16 05:25:20,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1955 transitions. [2020-10-16 05:25:20,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:20,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1955 transitions. [2020-10-16 05:25:20,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:20,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:20,889 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:20,889 INFO L185 Difference]: Start difference. First operand has 80 places, 57 transitions, 407 flow. Second operand 13 states and 1955 transitions. [2020-10-16 05:25:20,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 705 flow [2020-10-16 05:25:20,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 675 flow, removed 9 selfloop flow, removed 7 redundant places. [2020-10-16 05:25:20,894 INFO L241 Difference]: Finished difference. Result has 86 places, 54 transitions, 389 flow [2020-10-16 05:25:20,895 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=389, PETRI_PLACES=86, PETRI_TRANSITIONS=54} [2020-10-16 05:25:20,895 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2020-10-16 05:25:20,895 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 54 transitions, 389 flow [2020-10-16 05:25:20,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:20,895 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:20,895 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:20,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:25:20,896 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash -735355314, now seen corresponding path program 7 times [2020-10-16 05:25:20,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:20,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940253702] [2020-10-16 05:25:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:21,593 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 05:25:21,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940253702] [2020-10-16 05:25:21,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:21,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:21,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490625671] [2020-10-16 05:25:21,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:21,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:21,598 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:21,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 54 transitions, 389 flow. Second operand 14 states. [2020-10-16 05:25:21,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:21,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:21,600 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:22,698 INFO L129 PetriNetUnfolder]: 114/340 cut-off events. [2020-10-16 05:25:22,698 INFO L130 PetriNetUnfolder]: For 809/812 co-relation queries the response was YES. [2020-10-16 05:25:22,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 340 events. 114/340 cut-off events. For 809/812 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1831 event pairs, 50 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 1288. Up to 226 conditions per place. [2020-10-16 05:25:22,701 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 54 selfloop transitions, 16 changer transitions 16/91 dead transitions. [2020-10-16 05:25:22,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 773 flow [2020-10-16 05:25:22,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1961 transitions. [2020-10-16 05:25:22,706 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.49135554998747183 [2020-10-16 05:25:22,707 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1961 transitions. [2020-10-16 05:25:22,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1961 transitions. [2020-10-16 05:25:22,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:22,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1961 transitions. [2020-10-16 05:25:22,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:22,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:22,716 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:22,716 INFO L185 Difference]: Start difference. First operand has 86 places, 54 transitions, 389 flow. Second operand 13 states and 1961 transitions. [2020-10-16 05:25:22,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 773 flow [2020-10-16 05:25:22,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 701 flow, removed 21 selfloop flow, removed 14 redundant places. [2020-10-16 05:25:22,723 INFO L241 Difference]: Finished difference. Result has 83 places, 58 transitions, 423 flow [2020-10-16 05:25:22,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=423, PETRI_PLACES=83, PETRI_TRANSITIONS=58} [2020-10-16 05:25:22,723 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2020-10-16 05:25:22,723 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 58 transitions, 423 flow [2020-10-16 05:25:22,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:22,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:22,724 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:22,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:25:22,724 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash 467382556, now seen corresponding path program 8 times [2020-10-16 05:25:22,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:22,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278435306] [2020-10-16 05:25:22,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:23,437 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 05:25:23,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278435306] [2020-10-16 05:25:23,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:23,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:23,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70880243] [2020-10-16 05:25:23,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:23,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:23,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:23,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:23,440 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:23,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 423 flow. Second operand 14 states. [2020-10-16 05:25:23,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:23,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:23,441 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:24,527 INFO L129 PetriNetUnfolder]: 113/346 cut-off events. [2020-10-16 05:25:24,528 INFO L130 PetriNetUnfolder]: For 938/941 co-relation queries the response was YES. [2020-10-16 05:25:24,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 346 events. 113/346 cut-off events. For 938/941 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1908 event pairs, 56 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1334. Up to 262 conditions per place. [2020-10-16 05:25:24,531 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 53 selfloop transitions, 12 changer transitions 21/91 dead transitions. [2020-10-16 05:25:24,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 91 transitions, 803 flow [2020-10-16 05:25:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1953 transitions. [2020-10-16 05:25:24,534 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4893510398396392 [2020-10-16 05:25:24,534 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1953 transitions. [2020-10-16 05:25:24,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1953 transitions. [2020-10-16 05:25:24,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:24,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1953 transitions. [2020-10-16 05:25:24,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:24,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:24,543 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:24,543 INFO L185 Difference]: Start difference. First operand has 83 places, 58 transitions, 423 flow. Second operand 13 states and 1953 transitions. [2020-10-16 05:25:24,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 91 transitions, 803 flow [2020-10-16 05:25:24,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 91 transitions, 752 flow, removed 13 selfloop flow, removed 9 redundant places. [2020-10-16 05:25:24,552 INFO L241 Difference]: Finished difference. Result has 91 places, 64 transitions, 495 flow [2020-10-16 05:25:24,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=495, PETRI_PLACES=91, PETRI_TRANSITIONS=64} [2020-10-16 05:25:24,552 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2020-10-16 05:25:24,552 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 64 transitions, 495 flow [2020-10-16 05:25:24,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:24,552 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:24,553 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:24,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:25:24,553 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2017566794, now seen corresponding path program 9 times [2020-10-16 05:25:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:24,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905284349] [2020-10-16 05:25:24,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:25,301 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 05:25:25,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905284349] [2020-10-16 05:25:25,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:25,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:25,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555290138] [2020-10-16 05:25:25,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:25,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:25,305 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:25,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 64 transitions, 495 flow. Second operand 14 states. [2020-10-16 05:25:25,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:25,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:25,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:26,461 INFO L129 PetriNetUnfolder]: 112/344 cut-off events. [2020-10-16 05:25:26,462 INFO L130 PetriNetUnfolder]: For 1114/1122 co-relation queries the response was YES. [2020-10-16 05:25:26,464 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 344 events. 112/344 cut-off events. For 1114/1122 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1894 event pairs, 64 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 1379. Up to 266 conditions per place. [2020-10-16 05:25:26,466 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 54 selfloop transitions, 11 changer transitions 24/94 dead transitions. [2020-10-16 05:25:26,466 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 888 flow [2020-10-16 05:25:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1952 transitions. [2020-10-16 05:25:26,470 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4891004760711601 [2020-10-16 05:25:26,470 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1952 transitions. [2020-10-16 05:25:26,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1952 transitions. [2020-10-16 05:25:26,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:26,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1952 transitions. [2020-10-16 05:25:26,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:26,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:26,477 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:26,477 INFO L185 Difference]: Start difference. First operand has 91 places, 64 transitions, 495 flow. Second operand 13 states and 1952 transitions. [2020-10-16 05:25:26,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 888 flow [2020-10-16 05:25:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 842 flow, removed 22 selfloop flow, removed 6 redundant places. [2020-10-16 05:25:26,485 INFO L241 Difference]: Finished difference. Result has 100 places, 67 transitions, 559 flow [2020-10-16 05:25:26,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=559, PETRI_PLACES=100, PETRI_TRANSITIONS=67} [2020-10-16 05:25:26,486 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2020-10-16 05:25:26,486 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 67 transitions, 559 flow [2020-10-16 05:25:26,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:26,486 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:26,486 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:26,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:25:26,486 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash 96373258, now seen corresponding path program 10 times [2020-10-16 05:25:26,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:26,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240672952] [2020-10-16 05:25:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:27,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 05:25:27,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240672952] [2020-10-16 05:25:27,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:27,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:27,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655354951] [2020-10-16 05:25:27,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:27,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:27,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:27,264 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:27,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 67 transitions, 559 flow. Second operand 14 states. [2020-10-16 05:25:27,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:27,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:27,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:28,294 INFO L129 PetriNetUnfolder]: 110/340 cut-off events. [2020-10-16 05:25:28,294 INFO L130 PetriNetUnfolder]: For 1200/1202 co-relation queries the response was YES. [2020-10-16 05:25:28,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 340 events. 110/340 cut-off events. For 1200/1202 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1845 event pairs, 52 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 1386. Up to 234 conditions per place. [2020-10-16 05:25:28,298 INFO L132 encePairwiseOnDemand]: 292/307 looper letters, 62 selfloop transitions, 18 changer transitions 17/102 dead transitions. [2020-10-16 05:25:28,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 102 transitions, 989 flow [2020-10-16 05:25:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1960 transitions. [2020-10-16 05:25:28,306 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.49110498621899273 [2020-10-16 05:25:28,306 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1960 transitions. [2020-10-16 05:25:28,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1960 transitions. [2020-10-16 05:25:28,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:28,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1960 transitions. [2020-10-16 05:25:28,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:28,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:28,313 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:28,313 INFO L185 Difference]: Start difference. First operand has 100 places, 67 transitions, 559 flow. Second operand 13 states and 1960 transitions. [2020-10-16 05:25:28,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 102 transitions, 989 flow [2020-10-16 05:25:28,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 102 transitions, 924 flow, removed 26 selfloop flow, removed 10 redundant places. [2020-10-16 05:25:28,323 INFO L241 Difference]: Finished difference. Result has 102 places, 72 transitions, 630 flow [2020-10-16 05:25:28,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=630, PETRI_PLACES=102, PETRI_TRANSITIONS=72} [2020-10-16 05:25:28,323 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2020-10-16 05:25:28,324 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 72 transitions, 630 flow [2020-10-16 05:25:28,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:28,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:28,324 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:28,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:25:28,324 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash 888356494, now seen corresponding path program 11 times [2020-10-16 05:25:28,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:28,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352739462] [2020-10-16 05:25:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:29,076 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 05:25:29,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352739462] [2020-10-16 05:25:29,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:29,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:29,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784697886] [2020-10-16 05:25:29,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:29,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:29,081 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:29,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 72 transitions, 630 flow. Second operand 14 states. [2020-10-16 05:25:29,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:29,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:29,082 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:30,087 INFO L129 PetriNetUnfolder]: 98/306 cut-off events. [2020-10-16 05:25:30,087 INFO L130 PetriNetUnfolder]: For 1231/1236 co-relation queries the response was YES. [2020-10-16 05:25:30,089 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 306 events. 98/306 cut-off events. For 1231/1236 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1631 event pairs, 56 based on Foata normal form. 2/298 useless extension candidates. Maximal degree in co-relation 1298. Up to 231 conditions per place. [2020-10-16 05:25:30,090 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 52 selfloop transitions, 12 changer transitions 21/90 dead transitions. [2020-10-16 05:25:30,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 90 transitions, 901 flow [2020-10-16 05:25:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1951 transitions. [2020-10-16 05:25:30,092 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48884991230268104 [2020-10-16 05:25:30,093 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1951 transitions. [2020-10-16 05:25:30,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1951 transitions. [2020-10-16 05:25:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:30,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1951 transitions. [2020-10-16 05:25:30,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:30,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:30,098 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:30,098 INFO L185 Difference]: Start difference. First operand has 102 places, 72 transitions, 630 flow. Second operand 13 states and 1951 transitions. [2020-10-16 05:25:30,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 90 transitions, 901 flow [2020-10-16 05:25:30,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 90 transitions, 811 flow, removed 21 selfloop flow, removed 9 redundant places. [2020-10-16 05:25:30,107 INFO L241 Difference]: Finished difference. Result has 105 places, 67 transitions, 541 flow [2020-10-16 05:25:30,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=541, PETRI_PLACES=105, PETRI_TRANSITIONS=67} [2020-10-16 05:25:30,108 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2020-10-16 05:25:30,108 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 67 transitions, 541 flow [2020-10-16 05:25:30,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:30,108 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:30,108 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:30,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:25:30,108 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -74832696, now seen corresponding path program 2 times [2020-10-16 05:25:30,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:30,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057199744] [2020-10-16 05:25:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:30,414 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 05:25:30,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057199744] [2020-10-16 05:25:30,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:30,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:25:30,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116431377] [2020-10-16 05:25:30,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:25:30,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:30,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:25:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:25:30,420 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 307 [2020-10-16 05:25:30,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 67 transitions, 541 flow. Second operand 9 states. [2020-10-16 05:25:30,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:30,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 307 [2020-10-16 05:25:30,422 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:30,765 INFO L129 PetriNetUnfolder]: 92/305 cut-off events. [2020-10-16 05:25:30,765 INFO L130 PetriNetUnfolder]: For 871/874 co-relation queries the response was YES. [2020-10-16 05:25:30,766 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 305 events. 92/305 cut-off events. For 871/874 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1603 event pairs, 5 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 1128. Up to 140 conditions per place. [2020-10-16 05:25:30,768 INFO L132 encePairwiseOnDemand]: 300/307 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2020-10-16 05:25:30,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 84 transitions, 780 flow [2020-10-16 05:25:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:25:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:25:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1317 transitions. [2020-10-16 05:25:30,770 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5362377850162866 [2020-10-16 05:25:30,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1317 transitions. [2020-10-16 05:25:30,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1317 transitions. [2020-10-16 05:25:30,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:30,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1317 transitions. [2020-10-16 05:25:30,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:25:30,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:25:30,773 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:25:30,773 INFO L185 Difference]: Start difference. First operand has 105 places, 67 transitions, 541 flow. Second operand 8 states and 1317 transitions. [2020-10-16 05:25:30,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 84 transitions, 780 flow [2020-10-16 05:25:30,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 734 flow, removed 10 selfloop flow, removed 12 redundant places. [2020-10-16 05:25:30,779 INFO L241 Difference]: Finished difference. Result has 95 places, 69 transitions, 557 flow [2020-10-16 05:25:30,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=557, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2020-10-16 05:25:30,779 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2020-10-16 05:25:30,780 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 557 flow [2020-10-16 05:25:30,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:25:30,780 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:30,780 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:30,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:25:30,780 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2064052990, now seen corresponding path program 1 times [2020-10-16 05:25:30,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:30,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911756274] [2020-10-16 05:25:30,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:30,876 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 05:25:30,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911756274] [2020-10-16 05:25:30,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:30,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:25:30,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226590490] [2020-10-16 05:25:30,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:25:30,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:25:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:25:30,881 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 307 [2020-10-16 05:25:30,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 557 flow. Second operand 8 states. [2020-10-16 05:25:30,883 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:30,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 307 [2020-10-16 05:25:30,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:31,179 INFO L129 PetriNetUnfolder]: 78/265 cut-off events. [2020-10-16 05:25:31,179 INFO L130 PetriNetUnfolder]: For 1143/1145 co-relation queries the response was YES. [2020-10-16 05:25:31,181 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 265 events. 78/265 cut-off events. For 1143/1145 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1308 event pairs, 46 based on Foata normal form. 12/276 useless extension candidates. Maximal degree in co-relation 1039. Up to 202 conditions per place. [2020-10-16 05:25:31,182 INFO L132 encePairwiseOnDemand]: 300/307 looper letters, 61 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2020-10-16 05:25:31,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 84 transitions, 804 flow [2020-10-16 05:25:31,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:25:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:25:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1445 transitions. [2020-10-16 05:25:31,185 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5883550488599348 [2020-10-16 05:25:31,185 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1445 transitions. [2020-10-16 05:25:31,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1445 transitions. [2020-10-16 05:25:31,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:31,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1445 transitions. [2020-10-16 05:25:31,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:25:31,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:25:31,189 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:25:31,189 INFO L185 Difference]: Start difference. First operand has 95 places, 69 transitions, 557 flow. Second operand 8 states and 1445 transitions. [2020-10-16 05:25:31,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 84 transitions, 804 flow [2020-10-16 05:25:31,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 84 transitions, 785 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 05:25:31,197 INFO L241 Difference]: Finished difference. Result has 103 places, 74 transitions, 650 flow [2020-10-16 05:25:31,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=103, PETRI_TRANSITIONS=74} [2020-10-16 05:25:31,198 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2020-10-16 05:25:31,198 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 74 transitions, 650 flow [2020-10-16 05:25:31,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:25:31,198 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:31,198 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:31,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:25:31,198 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 448792210, now seen corresponding path program 12 times [2020-10-16 05:25:31,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:31,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259410028] [2020-10-16 05:25:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:31,938 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 05:25:31,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259410028] [2020-10-16 05:25:31,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:31,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:31,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366260589] [2020-10-16 05:25:31,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:31,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:31,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:31,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:31,942 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:31,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 74 transitions, 650 flow. Second operand 14 states. [2020-10-16 05:25:31,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:31,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:31,943 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:32,929 INFO L129 PetriNetUnfolder]: 70/262 cut-off events. [2020-10-16 05:25:32,929 INFO L130 PetriNetUnfolder]: For 1157/1157 co-relation queries the response was YES. [2020-10-16 05:25:32,931 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 262 events. 70/262 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1360 event pairs, 32 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 1113. Up to 178 conditions per place. [2020-10-16 05:25:32,932 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 62 selfloop transitions, 17 changer transitions 10/94 dead transitions. [2020-10-16 05:25:32,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 94 transitions, 996 flow [2020-10-16 05:25:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2097 transitions. [2020-10-16 05:25:32,936 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4879013494648674 [2020-10-16 05:25:32,936 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2097 transitions. [2020-10-16 05:25:32,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2097 transitions. [2020-10-16 05:25:32,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:32,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2097 transitions. [2020-10-16 05:25:32,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:32,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:32,945 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:32,945 INFO L185 Difference]: Start difference. First operand has 103 places, 74 transitions, 650 flow. Second operand 14 states and 2097 transitions. [2020-10-16 05:25:32,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 94 transitions, 996 flow [2020-10-16 05:25:32,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 94 transitions, 913 flow, removed 35 selfloop flow, removed 3 redundant places. [2020-10-16 05:25:32,955 INFO L241 Difference]: Finished difference. Result has 120 places, 79 transitions, 715 flow [2020-10-16 05:25:32,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=715, PETRI_PLACES=120, PETRI_TRANSITIONS=79} [2020-10-16 05:25:32,956 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2020-10-16 05:25:32,956 INFO L481 AbstractCegarLoop]: Abstraction has has 120 places, 79 transitions, 715 flow [2020-10-16 05:25:32,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:32,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:32,956 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:32,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:25:32,957 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2019940422, now seen corresponding path program 13 times [2020-10-16 05:25:32,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:32,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961098345] [2020-10-16 05:25:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:33,635 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 05:25:33,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961098345] [2020-10-16 05:25:33,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:33,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:33,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728899306] [2020-10-16 05:25:33,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:33,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:33,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:33,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:33,638 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:33,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 79 transitions, 715 flow. Second operand 14 states. [2020-10-16 05:25:33,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:33,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:33,639 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:34,572 INFO L129 PetriNetUnfolder]: 68/262 cut-off events. [2020-10-16 05:25:34,572 INFO L130 PetriNetUnfolder]: For 1069/1071 co-relation queries the response was YES. [2020-10-16 05:25:34,573 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 262 events. 68/262 cut-off events. For 1069/1071 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1374 event pairs, 37 based on Foata normal form. 3/260 useless extension candidates. Maximal degree in co-relation 1153. Up to 206 conditions per place. [2020-10-16 05:25:34,575 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 62 selfloop transitions, 12 changer transitions 13/92 dead transitions. [2020-10-16 05:25:34,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 92 transitions, 980 flow [2020-10-16 05:25:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1944 transitions. [2020-10-16 05:25:34,577 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4870959659233275 [2020-10-16 05:25:34,577 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1944 transitions. [2020-10-16 05:25:34,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1944 transitions. [2020-10-16 05:25:34,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:34,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1944 transitions. [2020-10-16 05:25:34,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:34,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:34,582 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:34,583 INFO L185 Difference]: Start difference. First operand has 120 places, 79 transitions, 715 flow. Second operand 13 states and 1944 transitions. [2020-10-16 05:25:34,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 92 transitions, 980 flow [2020-10-16 05:25:34,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 92 transitions, 891 flow, removed 26 selfloop flow, removed 11 redundant places. [2020-10-16 05:25:34,592 INFO L241 Difference]: Finished difference. Result has 123 places, 78 transitions, 664 flow [2020-10-16 05:25:34,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=664, PETRI_PLACES=123, PETRI_TRANSITIONS=78} [2020-10-16 05:25:34,593 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 86 predicate places. [2020-10-16 05:25:34,593 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 78 transitions, 664 flow [2020-10-16 05:25:34,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:34,593 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:34,593 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:34,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:25:34,593 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1552238534, now seen corresponding path program 14 times [2020-10-16 05:25:34,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:34,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600111225] [2020-10-16 05:25:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:35,207 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 05:25:35,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600111225] [2020-10-16 05:25:35,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:35,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:35,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103754414] [2020-10-16 05:25:35,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:35,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:35,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:35,211 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:35,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 78 transitions, 664 flow. Second operand 14 states. [2020-10-16 05:25:35,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:35,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:35,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:36,112 INFO L129 PetriNetUnfolder]: 66/245 cut-off events. [2020-10-16 05:25:36,112 INFO L130 PetriNetUnfolder]: For 834/835 co-relation queries the response was YES. [2020-10-16 05:25:36,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 245 events. 66/245 cut-off events. For 834/835 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1249 event pairs, 37 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 1031. Up to 193 conditions per place. [2020-10-16 05:25:36,114 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 59 selfloop transitions, 12 changer transitions 12/88 dead transitions. [2020-10-16 05:25:36,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 88 transitions, 903 flow [2020-10-16 05:25:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2089 transitions. [2020-10-16 05:25:36,117 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48604001861330853 [2020-10-16 05:25:36,117 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2089 transitions. [2020-10-16 05:25:36,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2089 transitions. [2020-10-16 05:25:36,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:36,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2089 transitions. [2020-10-16 05:25:36,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:36,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:36,123 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:36,123 INFO L185 Difference]: Start difference. First operand has 123 places, 78 transitions, 664 flow. Second operand 14 states and 2089 transitions. [2020-10-16 05:25:36,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 88 transitions, 903 flow [2020-10-16 05:25:36,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 88 transitions, 861 flow, removed 12 selfloop flow, removed 8 redundant places. [2020-10-16 05:25:36,135 INFO L241 Difference]: Finished difference. Result has 125 places, 75 transitions, 633 flow [2020-10-16 05:25:36,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=633, PETRI_PLACES=125, PETRI_TRANSITIONS=75} [2020-10-16 05:25:36,135 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 88 predicate places. [2020-10-16 05:25:36,135 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 75 transitions, 633 flow [2020-10-16 05:25:36,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:36,135 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:36,136 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:36,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:25:36,137 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash -74832690, now seen corresponding path program 15 times [2020-10-16 05:25:36,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:36,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957016316] [2020-10-16 05:25:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:36,836 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 05:25:36,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957016316] [2020-10-16 05:25:36,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:36,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:36,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823837414] [2020-10-16 05:25:36,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:36,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:36,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:36,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:36,839 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:36,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 75 transitions, 633 flow. Second operand 14 states. [2020-10-16 05:25:36,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:36,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:36,840 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:37,702 INFO L129 PetriNetUnfolder]: 65/230 cut-off events. [2020-10-16 05:25:37,702 INFO L130 PetriNetUnfolder]: For 734/735 co-relation queries the response was YES. [2020-10-16 05:25:37,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 230 events. 65/230 cut-off events. For 734/735 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1132 event pairs, 37 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 963. Up to 186 conditions per place. [2020-10-16 05:25:37,705 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 56 selfloop transitions, 8 changer transitions 14/83 dead transitions. [2020-10-16 05:25:37,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 83 transitions, 831 flow [2020-10-16 05:25:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1941 transitions. [2020-10-16 05:25:37,709 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48634427461789026 [2020-10-16 05:25:37,709 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1941 transitions. [2020-10-16 05:25:37,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1941 transitions. [2020-10-16 05:25:37,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:37,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1941 transitions. [2020-10-16 05:25:37,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:37,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:37,714 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:37,714 INFO L185 Difference]: Start difference. First operand has 125 places, 75 transitions, 633 flow. Second operand 13 states and 1941 transitions. [2020-10-16 05:25:37,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 83 transitions, 831 flow [2020-10-16 05:25:37,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 83 transitions, 785 flow, removed 6 selfloop flow, removed 12 redundant places. [2020-10-16 05:25:37,722 INFO L241 Difference]: Finished difference. Result has 122 places, 68 transitions, 542 flow [2020-10-16 05:25:37,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=542, PETRI_PLACES=122, PETRI_TRANSITIONS=68} [2020-10-16 05:25:37,723 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2020-10-16 05:25:37,723 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 68 transitions, 542 flow [2020-10-16 05:25:37,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:37,723 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:37,723 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:37,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:25:37,723 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:37,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash 391728868, now seen corresponding path program 16 times [2020-10-16 05:25:37,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:37,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779024498] [2020-10-16 05:25:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:38,381 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 05:25:38,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779024498] [2020-10-16 05:25:38,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:38,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:38,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527101733] [2020-10-16 05:25:38,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:38,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:38,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:38,385 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:38,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 68 transitions, 542 flow. Second operand 14 states. [2020-10-16 05:25:38,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:38,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:38,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:39,523 INFO L129 PetriNetUnfolder]: 69/235 cut-off events. [2020-10-16 05:25:39,523 INFO L130 PetriNetUnfolder]: For 648/648 co-relation queries the response was YES. [2020-10-16 05:25:39,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 235 events. 69/235 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1136 event pairs, 15 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 938. Up to 105 conditions per place. [2020-10-16 05:25:39,526 INFO L132 encePairwiseOnDemand]: 292/307 looper letters, 58 selfloop transitions, 29 changer transitions 2/94 dead transitions. [2020-10-16 05:25:39,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 94 transitions, 835 flow [2020-10-16 05:25:39,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2106 transitions. [2020-10-16 05:25:39,530 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4899953466728711 [2020-10-16 05:25:39,530 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2106 transitions. [2020-10-16 05:25:39,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2106 transitions. [2020-10-16 05:25:39,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:39,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2106 transitions. [2020-10-16 05:25:39,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:39,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:39,535 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:39,535 INFO L185 Difference]: Start difference. First operand has 122 places, 68 transitions, 542 flow. Second operand 14 states and 2106 transitions. [2020-10-16 05:25:39,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 94 transitions, 835 flow [2020-10-16 05:25:39,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 765 flow, removed 12 selfloop flow, removed 16 redundant places. [2020-10-16 05:25:39,542 INFO L241 Difference]: Finished difference. Result has 109 places, 73 transitions, 588 flow [2020-10-16 05:25:39,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=588, PETRI_PLACES=109, PETRI_TRANSITIONS=73} [2020-10-16 05:25:39,543 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 72 predicate places. [2020-10-16 05:25:39,543 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 73 transitions, 588 flow [2020-10-16 05:25:39,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:39,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:39,543 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:39,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 05:25:39,544 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:39,544 INFO L82 PathProgramCache]: Analyzing trace with hash -884277258, now seen corresponding path program 17 times [2020-10-16 05:25:39,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:39,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954010796] [2020-10-16 05:25:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:40,227 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 05:25:40,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954010796] [2020-10-16 05:25:40,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:40,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:40,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147871537] [2020-10-16 05:25:40,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:40,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:40,230 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:40,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 73 transitions, 588 flow. Second operand 14 states. [2020-10-16 05:25:40,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:40,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:40,232 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:41,358 INFO L129 PetriNetUnfolder]: 75/264 cut-off events. [2020-10-16 05:25:41,359 INFO L130 PetriNetUnfolder]: For 909/909 co-relation queries the response was YES. [2020-10-16 05:25:41,360 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 264 events. 75/264 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1356 event pairs, 18 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1061. Up to 124 conditions per place. [2020-10-16 05:25:41,361 INFO L132 encePairwiseOnDemand]: 291/307 looper letters, 63 selfloop transitions, 40 changer transitions 0/108 dead transitions. [2020-10-16 05:25:41,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 108 transitions, 1015 flow [2020-10-16 05:25:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 05:25:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 05:25:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2405 transitions. [2020-10-16 05:25:41,366 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48961726384364823 [2020-10-16 05:25:41,366 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2405 transitions. [2020-10-16 05:25:41,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2405 transitions. [2020-10-16 05:25:41,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:41,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2405 transitions. [2020-10-16 05:25:41,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 05:25:41,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 05:25:41,372 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 05:25:41,373 INFO L185 Difference]: Start difference. First operand has 109 places, 73 transitions, 588 flow. Second operand 16 states and 2405 transitions. [2020-10-16 05:25:41,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 108 transitions, 1015 flow [2020-10-16 05:25:41,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 108 transitions, 930 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-16 05:25:41,381 INFO L241 Difference]: Finished difference. Result has 121 places, 89 transitions, 768 flow [2020-10-16 05:25:41,381 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=768, PETRI_PLACES=121, PETRI_TRANSITIONS=89} [2020-10-16 05:25:41,382 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2020-10-16 05:25:41,382 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 89 transitions, 768 flow [2020-10-16 05:25:41,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:41,382 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:41,382 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:41,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 05:25:41,382 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:41,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 569534550, now seen corresponding path program 3 times [2020-10-16 05:25:41,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:41,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623199502] [2020-10-16 05:25:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:41,638 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 05:25:41,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623199502] [2020-10-16 05:25:41,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:41,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:25:41,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217263576] [2020-10-16 05:25:41,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:25:41,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:25:41,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:25:41,641 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 307 [2020-10-16 05:25:41,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 89 transitions, 768 flow. Second operand 9 states. [2020-10-16 05:25:41,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:41,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 307 [2020-10-16 05:25:41,642 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:42,001 INFO L129 PetriNetUnfolder]: 101/375 cut-off events. [2020-10-16 05:25:42,002 INFO L130 PetriNetUnfolder]: For 1425/1425 co-relation queries the response was YES. [2020-10-16 05:25:42,004 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 375 events. 101/375 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2322 event pairs, 20 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1586. Up to 113 conditions per place. [2020-10-16 05:25:42,005 INFO L132 encePairwiseOnDemand]: 297/307 looper letters, 76 selfloop transitions, 31 changer transitions 22/139 dead transitions. [2020-10-16 05:25:42,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 139 transitions, 1413 flow [2020-10-16 05:25:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:25:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:25:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1317 transitions. [2020-10-16 05:25:42,008 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5362377850162866 [2020-10-16 05:25:42,008 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1317 transitions. [2020-10-16 05:25:42,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1317 transitions. [2020-10-16 05:25:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:42,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1317 transitions. [2020-10-16 05:25:42,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:25:42,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:25:42,012 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:25:42,012 INFO L185 Difference]: Start difference. First operand has 121 places, 89 transitions, 768 flow. Second operand 8 states and 1317 transitions. [2020-10-16 05:25:42,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 139 transitions, 1413 flow [2020-10-16 05:25:42,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 139 transitions, 1329 flow, removed 22 selfloop flow, removed 6 redundant places. [2020-10-16 05:25:42,024 INFO L241 Difference]: Finished difference. Result has 123 places, 94 transitions, 844 flow [2020-10-16 05:25:42,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=844, PETRI_PLACES=123, PETRI_TRANSITIONS=94} [2020-10-16 05:25:42,024 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 86 predicate places. [2020-10-16 05:25:42,025 INFO L481 AbstractCegarLoop]: Abstraction has has 123 places, 94 transitions, 844 flow [2020-10-16 05:25:42,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:25:42,025 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:42,025 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:42,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 05:25:42,025 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:42,026 INFO L82 PathProgramCache]: Analyzing trace with hash 882723274, now seen corresponding path program 4 times [2020-10-16 05:25:42,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:42,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239724907] [2020-10-16 05:25:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:25:42,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239724907] [2020-10-16 05:25:42,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:42,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:25:42,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103955682] [2020-10-16 05:25:42,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:25:42,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:25:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:25:42,257 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 307 [2020-10-16 05:25:42,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 94 transitions, 844 flow. Second operand 9 states. [2020-10-16 05:25:42,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:42,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 307 [2020-10-16 05:25:42,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:42,597 INFO L129 PetriNetUnfolder]: 85/321 cut-off events. [2020-10-16 05:25:42,597 INFO L130 PetriNetUnfolder]: For 1389/1389 co-relation queries the response was YES. [2020-10-16 05:25:42,599 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 321 events. 85/321 cut-off events. For 1389/1389 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1853 event pairs, 16 based on Foata normal form. 1/321 useless extension candidates. Maximal degree in co-relation 1444. Up to 181 conditions per place. [2020-10-16 05:25:42,600 INFO L132 encePairwiseOnDemand]: 299/307 looper letters, 48 selfloop transitions, 29 changer transitions 20/107 dead transitions. [2020-10-16 05:25:42,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 107 transitions, 1141 flow [2020-10-16 05:25:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:25:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:25:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1312 transitions. [2020-10-16 05:25:42,602 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5342019543973942 [2020-10-16 05:25:42,602 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1312 transitions. [2020-10-16 05:25:42,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1312 transitions. [2020-10-16 05:25:42,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:42,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1312 transitions. [2020-10-16 05:25:42,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:25:42,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:25:42,605 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:25:42,605 INFO L185 Difference]: Start difference. First operand has 123 places, 94 transitions, 844 flow. Second operand 8 states and 1312 transitions. [2020-10-16 05:25:42,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 107 transitions, 1141 flow [2020-10-16 05:25:42,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 107 transitions, 1101 flow, removed 11 selfloop flow, removed 4 redundant places. [2020-10-16 05:25:42,617 INFO L241 Difference]: Finished difference. Result has 122 places, 80 transitions, 745 flow [2020-10-16 05:25:42,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=745, PETRI_PLACES=122, PETRI_TRANSITIONS=80} [2020-10-16 05:25:42,618 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2020-10-16 05:25:42,618 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 80 transitions, 745 flow [2020-10-16 05:25:42,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:25:42,618 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:42,618 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:42,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 05:25:42,619 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash 353930254, now seen corresponding path program 18 times [2020-10-16 05:25:42,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:42,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524001985] [2020-10-16 05:25:42,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:43,246 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 05:25:43,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524001985] [2020-10-16 05:25:43,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:43,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:43,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941930334] [2020-10-16 05:25:43,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:43,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:43,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:43,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:43,250 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:43,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 80 transitions, 745 flow. Second operand 14 states. [2020-10-16 05:25:43,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:43,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:43,251 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:44,206 INFO L129 PetriNetUnfolder]: 79/280 cut-off events. [2020-10-16 05:25:44,206 INFO L130 PetriNetUnfolder]: For 1421/1427 co-relation queries the response was YES. [2020-10-16 05:25:44,208 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 280 events. 79/280 cut-off events. For 1421/1427 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1465 event pairs, 28 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 1310. Up to 199 conditions per place. [2020-10-16 05:25:44,209 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 68 selfloop transitions, 19 changer transitions 1/93 dead transitions. [2020-10-16 05:25:44,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 93 transitions, 1019 flow [2020-10-16 05:25:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2093 transitions. [2020-10-16 05:25:44,212 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48697068403908794 [2020-10-16 05:25:44,212 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2093 transitions. [2020-10-16 05:25:44,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2093 transitions. [2020-10-16 05:25:44,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:44,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2093 transitions. [2020-10-16 05:25:44,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:44,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:44,218 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:44,218 INFO L185 Difference]: Start difference. First operand has 122 places, 80 transitions, 745 flow. Second operand 14 states and 2093 transitions. [2020-10-16 05:25:44,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 93 transitions, 1019 flow [2020-10-16 05:25:44,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 93 transitions, 923 flow, removed 26 selfloop flow, removed 11 redundant places. [2020-10-16 05:25:44,228 INFO L241 Difference]: Finished difference. Result has 121 places, 83 transitions, 728 flow [2020-10-16 05:25:44,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=728, PETRI_PLACES=121, PETRI_TRANSITIONS=83} [2020-10-16 05:25:44,229 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2020-10-16 05:25:44,229 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 83 transitions, 728 flow [2020-10-16 05:25:44,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:44,229 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:44,229 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:44,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 05:25:44,230 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash 825135182, now seen corresponding path program 19 times [2020-10-16 05:25:44,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:44,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504004191] [2020-10-16 05:25:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:44,989 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 05:25:44,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504004191] [2020-10-16 05:25:44,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:44,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:44,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745860697] [2020-10-16 05:25:44,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:44,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:44,993 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:44,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 83 transitions, 728 flow. Second operand 14 states. [2020-10-16 05:25:44,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:44,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:44,995 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:46,055 INFO L129 PetriNetUnfolder]: 83/303 cut-off events. [2020-10-16 05:25:46,055 INFO L130 PetriNetUnfolder]: For 1045/1045 co-relation queries the response was YES. [2020-10-16 05:25:46,060 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 303 events. 83/303 cut-off events. For 1045/1045 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1639 event pairs, 31 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 1313. Up to 211 conditions per place. [2020-10-16 05:25:46,062 INFO L132 encePairwiseOnDemand]: 291/307 looper letters, 73 selfloop transitions, 24 changer transitions 0/102 dead transitions. [2020-10-16 05:25:46,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 102 transitions, 1059 flow [2020-10-16 05:25:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 05:25:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 05:25:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2243 transitions. [2020-10-16 05:25:46,065 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48707926167209553 [2020-10-16 05:25:46,065 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2243 transitions. [2020-10-16 05:25:46,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2243 transitions. [2020-10-16 05:25:46,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:46,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2243 transitions. [2020-10-16 05:25:46,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 05:25:46,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 05:25:46,069 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 05:25:46,069 INFO L185 Difference]: Start difference. First operand has 121 places, 83 transitions, 728 flow. Second operand 15 states and 2243 transitions. [2020-10-16 05:25:46,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 102 transitions, 1059 flow [2020-10-16 05:25:46,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 102 transitions, 1012 flow, removed 4 selfloop flow, removed 10 redundant places. [2020-10-16 05:25:46,078 INFO L241 Difference]: Finished difference. Result has 129 places, 92 transitions, 852 flow [2020-10-16 05:25:46,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=852, PETRI_PLACES=129, PETRI_TRANSITIONS=92} [2020-10-16 05:25:46,079 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 92 predicate places. [2020-10-16 05:25:46,079 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 92 transitions, 852 flow [2020-10-16 05:25:46,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:46,079 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:46,079 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:46,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-16 05:25:46,079 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:46,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash -747816084, now seen corresponding path program 2 times [2020-10-16 05:25:46,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:46,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581862525] [2020-10-16 05:25:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:46,273 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 05:25:46,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581862525] [2020-10-16 05:25:46,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:46,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:46,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018458073] [2020-10-16 05:25:46,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 05:25:46,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 05:25:46,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-16 05:25:46,277 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 307 [2020-10-16 05:25:46,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 92 transitions, 852 flow. Second operand 13 states. [2020-10-16 05:25:46,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:46,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 307 [2020-10-16 05:25:46,278 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:46,970 INFO L129 PetriNetUnfolder]: 147/515 cut-off events. [2020-10-16 05:25:46,970 INFO L130 PetriNetUnfolder]: For 1951/1955 co-relation queries the response was YES. [2020-10-16 05:25:46,974 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 515 events. 147/515 cut-off events. For 1951/1955 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3272 event pairs, 46 based on Foata normal form. 8/522 useless extension candidates. Maximal degree in co-relation 2325. Up to 159 conditions per place. [2020-10-16 05:25:46,977 INFO L132 encePairwiseOnDemand]: 295/307 looper letters, 112 selfloop transitions, 48 changer transitions 10/172 dead transitions. [2020-10-16 05:25:46,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 172 transitions, 1840 flow [2020-10-16 05:25:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2203 transitions. [2020-10-16 05:25:46,981 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5125639832480223 [2020-10-16 05:25:46,981 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2203 transitions. [2020-10-16 05:25:46,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2203 transitions. [2020-10-16 05:25:46,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:46,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2203 transitions. [2020-10-16 05:25:46,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:46,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:46,989 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:46,990 INFO L185 Difference]: Start difference. First operand has 129 places, 92 transitions, 852 flow. Second operand 14 states and 2203 transitions. [2020-10-16 05:25:46,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 172 transitions, 1840 flow [2020-10-16 05:25:47,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 172 transitions, 1721 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-16 05:25:47,011 INFO L241 Difference]: Finished difference. Result has 138 places, 111 transitions, 1157 flow [2020-10-16 05:25:47,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1157, PETRI_PLACES=138, PETRI_TRANSITIONS=111} [2020-10-16 05:25:47,011 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 101 predicate places. [2020-10-16 05:25:47,011 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 111 transitions, 1157 flow [2020-10-16 05:25:47,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 05:25:47,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:47,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:47,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-16 05:25:47,012 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash -332618098, now seen corresponding path program 20 times [2020-10-16 05:25:47,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:47,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157818839] [2020-10-16 05:25:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:47,688 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 05:25:47,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157818839] [2020-10-16 05:25:47,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:47,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:47,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299776553] [2020-10-16 05:25:47,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:47,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:47,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:47,692 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:47,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 111 transitions, 1157 flow. Second operand 14 states. [2020-10-16 05:25:47,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:47,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:47,693 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:48,591 INFO L129 PetriNetUnfolder]: 112/456 cut-off events. [2020-10-16 05:25:48,591 INFO L130 PetriNetUnfolder]: For 2013/2015 co-relation queries the response was YES. [2020-10-16 05:25:48,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 456 events. 112/456 cut-off events. For 2013/2015 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2981 event pairs, 50 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 2172. Up to 347 conditions per place. [2020-10-16 05:25:48,595 INFO L132 encePairwiseOnDemand]: 292/307 looper letters, 90 selfloop transitions, 22 changer transitions 4/121 dead transitions. [2020-10-16 05:25:48,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 121 transitions, 1458 flow [2020-10-16 05:25:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:25:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:25:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2092 transitions. [2020-10-16 05:25:48,597 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4867380176826431 [2020-10-16 05:25:48,597 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2092 transitions. [2020-10-16 05:25:48,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2092 transitions. [2020-10-16 05:25:48,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:48,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2092 transitions. [2020-10-16 05:25:48,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:25:48,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:25:48,602 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:25:48,602 INFO L185 Difference]: Start difference. First operand has 138 places, 111 transitions, 1157 flow. Second operand 14 states and 2092 transitions. [2020-10-16 05:25:48,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 121 transitions, 1458 flow [2020-10-16 05:25:48,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 121 transitions, 1433 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 05:25:48,618 INFO L241 Difference]: Finished difference. Result has 149 places, 112 transitions, 1199 flow [2020-10-16 05:25:48,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1199, PETRI_PLACES=149, PETRI_TRANSITIONS=112} [2020-10-16 05:25:48,619 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 112 predicate places. [2020-10-16 05:25:48,619 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 112 transitions, 1199 flow [2020-10-16 05:25:48,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:48,619 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:48,619 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:48,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-16 05:25:48,620 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1720652860, now seen corresponding path program 21 times [2020-10-16 05:25:48,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:48,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86510050] [2020-10-16 05:25:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:49,286 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 05:25:49,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86510050] [2020-10-16 05:25:49,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:49,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:49,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630663492] [2020-10-16 05:25:49,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:49,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:49,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:49,289 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:49,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 112 transitions, 1199 flow. Second operand 14 states. [2020-10-16 05:25:49,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:49,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:49,290 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:50,270 INFO L129 PetriNetUnfolder]: 122/520 cut-off events. [2020-10-16 05:25:50,270 INFO L130 PetriNetUnfolder]: For 2475/2477 co-relation queries the response was YES. [2020-10-16 05:25:50,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 520 events. 122/520 cut-off events. For 2475/2477 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3652 event pairs, 40 based on Foata normal form. 5/524 useless extension candidates. Maximal degree in co-relation 2501. Up to 291 conditions per place. [2020-10-16 05:25:50,276 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 91 selfloop transitions, 25 changer transitions 22/143 dead transitions. [2020-10-16 05:25:50,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 143 transitions, 1725 flow [2020-10-16 05:25:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1952 transitions. [2020-10-16 05:25:50,282 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4891004760711601 [2020-10-16 05:25:50,282 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1952 transitions. [2020-10-16 05:25:50,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1952 transitions. [2020-10-16 05:25:50,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:50,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1952 transitions. [2020-10-16 05:25:50,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:50,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:50,286 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:50,286 INFO L185 Difference]: Start difference. First operand has 149 places, 112 transitions, 1199 flow. Second operand 13 states and 1952 transitions. [2020-10-16 05:25:50,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 143 transitions, 1725 flow [2020-10-16 05:25:50,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 143 transitions, 1658 flow, removed 14 selfloop flow, removed 12 redundant places. [2020-10-16 05:25:50,303 INFO L241 Difference]: Finished difference. Result has 152 places, 112 transitions, 1213 flow [2020-10-16 05:25:50,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1213, PETRI_PLACES=152, PETRI_TRANSITIONS=112} [2020-10-16 05:25:50,304 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 115 predicate places. [2020-10-16 05:25:50,304 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 112 transitions, 1213 flow [2020-10-16 05:25:50,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:50,304 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:50,304 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:50,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-16 05:25:50,304 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:50,305 INFO L82 PathProgramCache]: Analyzing trace with hash -745154566, now seen corresponding path program 22 times [2020-10-16 05:25:50,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:50,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81030265] [2020-10-16 05:25:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:50,921 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 05:25:50,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81030265] [2020-10-16 05:25:50,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:50,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:50,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2445108] [2020-10-16 05:25:50,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:50,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:50,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:50,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:50,925 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:50,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 112 transitions, 1213 flow. Second operand 14 states. [2020-10-16 05:25:50,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:50,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:50,926 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:51,857 INFO L129 PetriNetUnfolder]: 83/405 cut-off events. [2020-10-16 05:25:51,857 INFO L130 PetriNetUnfolder]: For 1918/1920 co-relation queries the response was YES. [2020-10-16 05:25:51,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 405 events. 83/405 cut-off events. For 1918/1920 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2657 event pairs, 30 based on Foata normal form. 4/409 useless extension candidates. Maximal degree in co-relation 2004. Up to 220 conditions per place. [2020-10-16 05:25:51,861 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 71 selfloop transitions, 22 changer transitions 26/124 dead transitions. [2020-10-16 05:25:51,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 124 transitions, 1546 flow [2020-10-16 05:25:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1947 transitions. [2020-10-16 05:25:51,864 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4878476572287647 [2020-10-16 05:25:51,864 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1947 transitions. [2020-10-16 05:25:51,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1947 transitions. [2020-10-16 05:25:51,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:51,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1947 transitions. [2020-10-16 05:25:51,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:51,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:51,869 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:51,869 INFO L185 Difference]: Start difference. First operand has 152 places, 112 transitions, 1213 flow. Second operand 13 states and 1947 transitions. [2020-10-16 05:25:51,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 124 transitions, 1546 flow [2020-10-16 05:25:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 124 transitions, 1482 flow, removed 9 selfloop flow, removed 10 redundant places. [2020-10-16 05:25:51,881 INFO L241 Difference]: Finished difference. Result has 153 places, 93 transitions, 994 flow [2020-10-16 05:25:51,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=994, PETRI_PLACES=153, PETRI_TRANSITIONS=93} [2020-10-16 05:25:51,881 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 116 predicate places. [2020-10-16 05:25:51,881 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 93 transitions, 994 flow [2020-10-16 05:25:51,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:51,882 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:51,882 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:51,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-16 05:25:51,882 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash -706175688, now seen corresponding path program 23 times [2020-10-16 05:25:51,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:51,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614477240] [2020-10-16 05:25:51,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:52,574 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 05:25:52,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614477240] [2020-10-16 05:25:52,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:52,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:52,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881935662] [2020-10-16 05:25:52,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:52,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:52,576 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:52,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 93 transitions, 994 flow. Second operand 14 states. [2020-10-16 05:25:52,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:52,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:52,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:53,659 INFO L129 PetriNetUnfolder]: 92/393 cut-off events. [2020-10-16 05:25:53,659 INFO L130 PetriNetUnfolder]: For 2264/2266 co-relation queries the response was YES. [2020-10-16 05:25:53,661 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2037 conditions, 393 events. 92/393 cut-off events. For 2264/2266 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2547 event pairs, 37 based on Foata normal form. 2/395 useless extension candidates. Maximal degree in co-relation 1987. Up to 277 conditions per place. [2020-10-16 05:25:53,662 INFO L132 encePairwiseOnDemand]: 291/307 looper letters, 83 selfloop transitions, 27 changer transitions 12/127 dead transitions. [2020-10-16 05:25:53,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 127 transitions, 1603 flow [2020-10-16 05:25:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 05:25:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 05:25:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2397 transitions. [2020-10-16 05:25:53,666 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4879885993485342 [2020-10-16 05:25:53,666 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2397 transitions. [2020-10-16 05:25:53,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2397 transitions. [2020-10-16 05:25:53,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:53,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2397 transitions. [2020-10-16 05:25:53,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 05:25:53,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 05:25:53,672 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 05:25:53,672 INFO L185 Difference]: Start difference. First operand has 153 places, 93 transitions, 994 flow. Second operand 16 states and 2397 transitions. [2020-10-16 05:25:53,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 127 transitions, 1603 flow [2020-10-16 05:25:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 1420 flow, removed 32 selfloop flow, removed 19 redundant places. [2020-10-16 05:25:53,688 INFO L241 Difference]: Finished difference. Result has 144 places, 107 transitions, 1098 flow [2020-10-16 05:25:53,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1098, PETRI_PLACES=144, PETRI_TRANSITIONS=107} [2020-10-16 05:25:53,689 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 107 predicate places. [2020-10-16 05:25:53,689 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 107 transitions, 1098 flow [2020-10-16 05:25:53,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:53,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:53,689 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:53,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-16 05:25:53,690 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1312646182, now seen corresponding path program 24 times [2020-10-16 05:25:53,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:53,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699080636] [2020-10-16 05:25:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:54,524 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 05:25:54,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699080636] [2020-10-16 05:25:54,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:54,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:54,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633724826] [2020-10-16 05:25:54,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:54,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:54,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:54,530 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:54,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 107 transitions, 1098 flow. Second operand 14 states. [2020-10-16 05:25:54,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:54,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:54,542 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:55,597 INFO L129 PetriNetUnfolder]: 94/412 cut-off events. [2020-10-16 05:25:55,598 INFO L130 PetriNetUnfolder]: For 2402/2406 co-relation queries the response was YES. [2020-10-16 05:25:55,600 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 412 events. 94/412 cut-off events. For 2402/2406 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2744 event pairs, 39 based on Foata normal form. 3/414 useless extension candidates. Maximal degree in co-relation 2085. Up to 276 conditions per place. [2020-10-16 05:25:55,601 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 85 selfloop transitions, 22 changer transitions 20/132 dead transitions. [2020-10-16 05:25:55,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 132 transitions, 1618 flow [2020-10-16 05:25:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 05:25:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 05:25:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2243 transitions. [2020-10-16 05:25:55,605 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48707926167209553 [2020-10-16 05:25:55,605 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2243 transitions. [2020-10-16 05:25:55,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2243 transitions. [2020-10-16 05:25:55,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:55,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2243 transitions. [2020-10-16 05:25:55,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 05:25:55,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 05:25:55,610 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 05:25:55,610 INFO L185 Difference]: Start difference. First operand has 144 places, 107 transitions, 1098 flow. Second operand 15 states and 2243 transitions. [2020-10-16 05:25:55,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 132 transitions, 1618 flow [2020-10-16 05:25:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 132 transitions, 1537 flow, removed 32 selfloop flow, removed 8 redundant places. [2020-10-16 05:25:55,623 INFO L241 Difference]: Finished difference. Result has 152 places, 106 transitions, 1085 flow [2020-10-16 05:25:55,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1085, PETRI_PLACES=152, PETRI_TRANSITIONS=106} [2020-10-16 05:25:55,624 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 115 predicate places. [2020-10-16 05:25:55,624 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 106 transitions, 1085 flow [2020-10-16 05:25:55,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:55,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:55,624 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:55,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-16 05:25:55,624 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 857912820, now seen corresponding path program 25 times [2020-10-16 05:25:55,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:55,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873707679] [2020-10-16 05:25:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:25:56,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873707679] [2020-10-16 05:25:56,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:56,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:56,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483841311] [2020-10-16 05:25:56,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:56,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:56,258 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:56,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 106 transitions, 1085 flow. Second operand 14 states. [2020-10-16 05:25:56,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:56,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:56,259 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:57,270 INFO L129 PetriNetUnfolder]: 83/385 cut-off events. [2020-10-16 05:25:57,270 INFO L130 PetriNetUnfolder]: For 2091/2095 co-relation queries the response was YES. [2020-10-16 05:25:57,272 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 385 events. 83/385 cut-off events. For 2091/2095 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2528 event pairs, 32 based on Foata normal form. 3/387 useless extension candidates. Maximal degree in co-relation 1962. Up to 238 conditions per place. [2020-10-16 05:25:57,273 INFO L132 encePairwiseOnDemand]: 293/307 looper letters, 77 selfloop transitions, 13 changer transitions 26/121 dead transitions. [2020-10-16 05:25:57,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 121 transitions, 1420 flow [2020-10-16 05:25:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1949 transitions. [2020-10-16 05:25:57,277 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48834878476572285 [2020-10-16 05:25:57,277 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1949 transitions. [2020-10-16 05:25:57,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1949 transitions. [2020-10-16 05:25:57,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:57,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1949 transitions. [2020-10-16 05:25:57,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:57,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:57,282 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:57,282 INFO L185 Difference]: Start difference. First operand has 152 places, 106 transitions, 1085 flow. Second operand 13 states and 1949 transitions. [2020-10-16 05:25:57,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 121 transitions, 1420 flow [2020-10-16 05:25:57,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 121 transitions, 1346 flow, removed 18 selfloop flow, removed 11 redundant places. [2020-10-16 05:25:57,295 INFO L241 Difference]: Finished difference. Result has 152 places, 92 transitions, 922 flow [2020-10-16 05:25:57,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=922, PETRI_PLACES=152, PETRI_TRANSITIONS=92} [2020-10-16 05:25:57,296 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 115 predicate places. [2020-10-16 05:25:57,296 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 92 transitions, 922 flow [2020-10-16 05:25:57,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:57,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:57,296 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:57,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-16 05:25:57,296 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:57,297 INFO L82 PathProgramCache]: Analyzing trace with hash 926288630, now seen corresponding path program 26 times [2020-10-16 05:25:57,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:57,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389457957] [2020-10-16 05:25:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:58,032 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 05:25:58,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389457957] [2020-10-16 05:25:58,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:58,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:58,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511240726] [2020-10-16 05:25:58,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:58,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:58,037 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:58,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 92 transitions, 922 flow. Second operand 14 states. [2020-10-16 05:25:58,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:58,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:58,038 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:25:58,846 INFO L129 PetriNetUnfolder]: 57/306 cut-off events. [2020-10-16 05:25:58,846 INFO L130 PetriNetUnfolder]: For 1603/1605 co-relation queries the response was YES. [2020-10-16 05:25:58,848 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 306 events. 57/306 cut-off events. For 1603/1605 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1864 event pairs, 34 based on Foata normal form. 3/309 useless extension candidates. Maximal degree in co-relation 1532. Up to 207 conditions per place. [2020-10-16 05:25:58,849 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 66 selfloop transitions, 11 changer transitions 19/101 dead transitions. [2020-10-16 05:25:58,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 101 transitions, 1194 flow [2020-10-16 05:25:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:25:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:25:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1940 transitions. [2020-10-16 05:25:58,852 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48609371084941116 [2020-10-16 05:25:58,852 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1940 transitions. [2020-10-16 05:25:58,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1940 transitions. [2020-10-16 05:25:58,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:25:58,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1940 transitions. [2020-10-16 05:25:58,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:25:58,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:25:58,858 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:25:58,858 INFO L185 Difference]: Start difference. First operand has 152 places, 92 transitions, 922 flow. Second operand 13 states and 1940 transitions. [2020-10-16 05:25:58,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 101 transitions, 1194 flow [2020-10-16 05:25:58,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 101 transitions, 1146 flow, removed 8 selfloop flow, removed 14 redundant places. [2020-10-16 05:25:58,870 INFO L241 Difference]: Finished difference. Result has 146 places, 81 transitions, 801 flow [2020-10-16 05:25:58,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=801, PETRI_PLACES=146, PETRI_TRANSITIONS=81} [2020-10-16 05:25:58,871 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 109 predicate places. [2020-10-16 05:25:58,871 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 81 transitions, 801 flow [2020-10-16 05:25:58,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:25:58,871 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:25:58,871 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:25:58,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-16 05:25:58,871 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:25:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:25:58,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1452487044, now seen corresponding path program 27 times [2020-10-16 05:25:58,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:25:58,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040393804] [2020-10-16 05:25:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:25:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:25:59,523 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 05:25:59,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040393804] [2020-10-16 05:25:59,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:25:59,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:25:59,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850537980] [2020-10-16 05:25:59,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:25:59,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:25:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:25:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:25:59,526 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:25:59,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 81 transitions, 801 flow. Second operand 14 states. [2020-10-16 05:25:59,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:25:59,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:25:59,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:26:00,569 INFO L129 PetriNetUnfolder]: 74/350 cut-off events. [2020-10-16 05:26:00,569 INFO L130 PetriNetUnfolder]: For 1790/1796 co-relation queries the response was YES. [2020-10-16 05:26:00,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 350 events. 74/350 cut-off events. For 1790/1796 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2272 event pairs, 24 based on Foata normal form. 3/353 useless extension candidates. Maximal degree in co-relation 1687. Up to 173 conditions per place. [2020-10-16 05:26:00,572 INFO L132 encePairwiseOnDemand]: 292/307 looper letters, 65 selfloop transitions, 31 changer transitions 17/118 dead transitions. [2020-10-16 05:26:00,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 118 transitions, 1386 flow [2020-10-16 05:26:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 05:26:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 05:26:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2397 transitions. [2020-10-16 05:26:00,578 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.4879885993485342 [2020-10-16 05:26:00,578 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2397 transitions. [2020-10-16 05:26:00,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2397 transitions. [2020-10-16 05:26:00,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:26:00,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2397 transitions. [2020-10-16 05:26:00,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 05:26:00,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 05:26:00,601 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 05:26:00,602 INFO L185 Difference]: Start difference. First operand has 146 places, 81 transitions, 801 flow. Second operand 16 states and 2397 transitions. [2020-10-16 05:26:00,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 118 transitions, 1386 flow [2020-10-16 05:26:00,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 118 transitions, 1302 flow, removed 20 selfloop flow, removed 15 redundant places. [2020-10-16 05:26:00,615 INFO L241 Difference]: Finished difference. Result has 140 places, 90 transitions, 928 flow [2020-10-16 05:26:00,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=928, PETRI_PLACES=140, PETRI_TRANSITIONS=90} [2020-10-16 05:26:00,615 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 103 predicate places. [2020-10-16 05:26:00,616 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 90 transitions, 928 flow [2020-10-16 05:26:00,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:26:00,616 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:26:00,616 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:26:00,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-16 05:26:00,616 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:26:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:26:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash -55079610, now seen corresponding path program 28 times [2020-10-16 05:26:00,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:26:00,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702692819] [2020-10-16 05:26:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:26:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:26:01,252 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 05:26:01,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702692819] [2020-10-16 05:26:01,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:26:01,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:26:01,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859484690] [2020-10-16 05:26:01,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:26:01,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:26:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:26:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:26:01,255 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:26:01,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 90 transitions, 928 flow. Second operand 14 states. [2020-10-16 05:26:01,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:26:01,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:26:01,256 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:26:02,226 INFO L129 PetriNetUnfolder]: 62/322 cut-off events. [2020-10-16 05:26:02,226 INFO L130 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2020-10-16 05:26:02,228 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 322 events. 62/322 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2069 event pairs, 10 based on Foata normal form. 4/326 useless extension candidates. Maximal degree in co-relation 1699. Up to 85 conditions per place. [2020-10-16 05:26:02,229 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 49 selfloop transitions, 17 changer transitions 32/103 dead transitions. [2020-10-16 05:26:02,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 103 transitions, 1223 flow [2020-10-16 05:26:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:26:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:26:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1949 transitions. [2020-10-16 05:26:02,232 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48834878476572285 [2020-10-16 05:26:02,233 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1949 transitions. [2020-10-16 05:26:02,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1949 transitions. [2020-10-16 05:26:02,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:26:02,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1949 transitions. [2020-10-16 05:26:02,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:26:02,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:26:02,235 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:26:02,235 INFO L185 Difference]: Start difference. First operand has 140 places, 90 transitions, 928 flow. Second operand 13 states and 1949 transitions. [2020-10-16 05:26:02,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 103 transitions, 1223 flow [2020-10-16 05:26:02,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 103 transitions, 1016 flow, removed 54 selfloop flow, removed 16 redundant places. [2020-10-16 05:26:02,244 INFO L241 Difference]: Finished difference. Result has 135 places, 68 transitions, 603 flow [2020-10-16 05:26:02,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=603, PETRI_PLACES=135, PETRI_TRANSITIONS=68} [2020-10-16 05:26:02,245 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 98 predicate places. [2020-10-16 05:26:02,245 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 68 transitions, 603 flow [2020-10-16 05:26:02,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:26:02,245 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:26:02,245 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:26:02,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-16 05:26:02,245 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:26:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:26:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash 788599106, now seen corresponding path program 29 times [2020-10-16 05:26:02,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:26:02,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170759245] [2020-10-16 05:26:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:26:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:26:02,870 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 05:26:02,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170759245] [2020-10-16 05:26:02,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:26:02,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:26:02,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480527152] [2020-10-16 05:26:02,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:26:02,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:26:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:26:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:26:02,873 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:26:02,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 68 transitions, 603 flow. Second operand 14 states. [2020-10-16 05:26:02,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:26:02,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:26:02,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:26:03,643 INFO L129 PetriNetUnfolder]: 12/145 cut-off events. [2020-10-16 05:26:03,643 INFO L130 PetriNetUnfolder]: For 481/481 co-relation queries the response was YES. [2020-10-16 05:26:03,644 INFO L80 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 145 events. 12/145 cut-off events. For 481/481 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 669 event pairs, 8 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 645. Up to 71 conditions per place. [2020-10-16 05:26:03,645 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 38 selfloop transitions, 5 changer transitions 26/73 dead transitions. [2020-10-16 05:26:03,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 73 transitions, 781 flow [2020-10-16 05:26:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:26:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:26:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1940 transitions. [2020-10-16 05:26:03,647 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48609371084941116 [2020-10-16 05:26:03,647 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1940 transitions. [2020-10-16 05:26:03,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1940 transitions. [2020-10-16 05:26:03,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:26:03,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1940 transitions. [2020-10-16 05:26:03,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:26:03,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:26:03,649 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:26:03,650 INFO L185 Difference]: Start difference. First operand has 135 places, 68 transitions, 603 flow. Second operand 13 states and 1940 transitions. [2020-10-16 05:26:03,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 73 transitions, 781 flow [2020-10-16 05:26:03,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 73 transitions, 641 flow, removed 12 selfloop flow, removed 28 redundant places. [2020-10-16 05:26:03,654 INFO L241 Difference]: Finished difference. Result has 115 places, 47 transitions, 343 flow [2020-10-16 05:26:03,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=115, PETRI_TRANSITIONS=47} [2020-10-16 05:26:03,654 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2020-10-16 05:26:03,654 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 47 transitions, 343 flow [2020-10-16 05:26:03,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:26:03,655 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:26:03,655 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:26:03,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-16 05:26:03,655 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:26:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:26:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1701591536, now seen corresponding path program 30 times [2020-10-16 05:26:03,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:26:03,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094490055] [2020-10-16 05:26:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:26:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:26:04,452 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 05:26:04,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094490055] [2020-10-16 05:26:04,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:26:04,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:26:04,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599468053] [2020-10-16 05:26:04,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:26:04,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:26:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:26:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:26:04,458 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 307 [2020-10-16 05:26:04,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 47 transitions, 343 flow. Second operand 14 states. [2020-10-16 05:26:04,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:26:04,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 307 [2020-10-16 05:26:04,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:26:05,311 INFO L129 PetriNetUnfolder]: 8/92 cut-off events. [2020-10-16 05:26:05,311 INFO L130 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2020-10-16 05:26:05,312 INFO L80 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 92 events. 8/92 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 325 event pairs, 7 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 355. Up to 57 conditions per place. [2020-10-16 05:26:05,312 INFO L132 encePairwiseOnDemand]: 294/307 looper letters, 27 selfloop transitions, 4 changer transitions 14/49 dead transitions. [2020-10-16 05:26:05,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 49 transitions, 434 flow [2020-10-16 05:26:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:26:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:26:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1932 transitions. [2020-10-16 05:26:05,314 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.48408920070157857 [2020-10-16 05:26:05,314 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1932 transitions. [2020-10-16 05:26:05,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1932 transitions. [2020-10-16 05:26:05,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:26:05,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1932 transitions. [2020-10-16 05:26:05,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:26:05,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:26:05,317 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:26:05,317 INFO L185 Difference]: Start difference. First operand has 115 places, 47 transitions, 343 flow. Second operand 13 states and 1932 transitions. [2020-10-16 05:26:05,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 49 transitions, 434 flow [2020-10-16 05:26:05,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 49 transitions, 367 flow, removed 4 selfloop flow, removed 21 redundant places. [2020-10-16 05:26:05,320 INFO L241 Difference]: Finished difference. Result has 86 places, 35 transitions, 218 flow [2020-10-16 05:26:05,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=218, PETRI_PLACES=86, PETRI_TRANSITIONS=35} [2020-10-16 05:26:05,320 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2020-10-16 05:26:05,320 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 35 transitions, 218 flow [2020-10-16 05:26:05,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:26:05,320 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:26:05,320 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:26:05,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-16 05:26:05,320 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:26:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:26:05,321 INFO L82 PathProgramCache]: Analyzing trace with hash 353930248, now seen corresponding path program 5 times [2020-10-16 05:26:05,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:26:05,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538278481] [2020-10-16 05:26:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:26:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:26:05,570 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 05:26:05,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538278481] [2020-10-16 05:26:05,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:26:05,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:26:05,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184628126] [2020-10-16 05:26:05,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:26:05,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:26:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:26:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:26:05,573 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 307 [2020-10-16 05:26:05,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 35 transitions, 218 flow. Second operand 9 states. [2020-10-16 05:26:05,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:26:05,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 307 [2020-10-16 05:26:05,574 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:26:05,815 INFO L129 PetriNetUnfolder]: 8/70 cut-off events. [2020-10-16 05:26:05,816 INFO L130 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2020-10-16 05:26:05,816 INFO L80 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 70 events. 8/70 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 4 based on Foata normal form. 3/73 useless extension candidates. Maximal degree in co-relation 238. Up to 43 conditions per place. [2020-10-16 05:26:05,817 INFO L132 encePairwiseOnDemand]: 301/307 looper letters, 0 selfloop transitions, 0 changer transitions 33/33 dead transitions. [2020-10-16 05:26:05,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 33 transitions, 255 flow [2020-10-16 05:26:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:26:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:26:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1302 transitions. [2020-10-16 05:26:05,822 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5301302931596091 [2020-10-16 05:26:05,822 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1302 transitions. [2020-10-16 05:26:05,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1302 transitions. [2020-10-16 05:26:05,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:26:05,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1302 transitions. [2020-10-16 05:26:05,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:26:05,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:26:05,825 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:26:05,825 INFO L185 Difference]: Start difference. First operand has 86 places, 35 transitions, 218 flow. Second operand 8 states and 1302 transitions. [2020-10-16 05:26:05,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 33 transitions, 255 flow [2020-10-16 05:26:05,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 33 transitions, 220 flow, removed 0 selfloop flow, removed 12 redundant places. [2020-10-16 05:26:05,826 INFO L241 Difference]: Finished difference. Result has 64 places, 0 transitions, 0 flow [2020-10-16 05:26:05,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=64, PETRI_TRANSITIONS=0} [2020-10-16 05:26:05,826 INFO L342 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2020-10-16 05:26:05,827 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 0 transitions, 0 flow [2020-10-16 05:26:05,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:26:05,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-16 05:26:05,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:26:05 BasicIcfg [2020-10-16 05:26:05,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:26:05,831 INFO L168 Benchmark]: Toolchain (without parser) took 117702.05 ms. Allocated memory was 253.2 MB in the beginning and 763.9 MB in the end (delta: 510.7 MB). Free memory was 207.3 MB in the beginning and 435.0 MB in the end (delta: -227.7 MB). Peak memory consumption was 282.9 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,832 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1264.63 ms. Allocated memory was 253.2 MB in the beginning and 360.2 MB in the end (delta: 107.0 MB). Free memory was 207.3 MB in the beginning and 324.2 MB in the end (delta: -117.0 MB). Peak memory consumption was 110.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.65 ms. Allocated memory is still 360.2 MB. Free memory was 324.2 MB in the beginning and 319.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,836 INFO L168 Benchmark]: Boogie Preprocessor took 57.56 ms. Allocated memory is still 360.2 MB. Free memory was 319.8 MB in the beginning and 317.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,836 INFO L168 Benchmark]: RCFGBuilder took 630.41 ms. Allocated memory is still 360.2 MB. Free memory was 317.6 MB in the beginning and 267.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,841 INFO L168 Benchmark]: TraceAbstraction took 115669.23 ms. Allocated memory was 360.2 MB in the beginning and 763.9 MB in the end (delta: 403.7 MB). Free memory was 267.9 MB in the beginning and 435.0 MB in the end (delta: -167.1 MB). Peak memory consumption was 236.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:26:05,843 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.40 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1264.63 ms. Allocated memory was 253.2 MB in the beginning and 360.2 MB in the end (delta: 107.0 MB). Free memory was 207.3 MB in the beginning and 324.2 MB in the end (delta: -117.0 MB). Peak memory consumption was 110.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 74.65 ms. Allocated memory is still 360.2 MB. Free memory was 324.2 MB in the beginning and 319.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 57.56 ms. Allocated memory is still 360.2 MB. Free memory was 319.8 MB in the beginning and 317.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.2 GB. * RCFGBuilder took 630.41 ms. Allocated memory is still 360.2 MB. Free memory was 317.6 MB in the beginning and 267.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 115669.23 ms. Allocated memory was 360.2 MB in the beginning and 763.9 MB in the end (delta: 403.7 MB). Free memory was 267.9 MB in the beginning and 435.0 MB in the end (delta: -167.1 MB). Peak memory consumption was 236.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1604 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 51.7s, 127 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 58.8s, 142 PlacesBefore, 37 PlacesAfterwards, 144 TransitionsBefore, 35 TransitionsAfterwards, 2436 CoEnabledTransitionPairs, 7 FixpointIterations, 81 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 152 TotalNumberOfCompositions, 5917 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 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: 115.5s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 58.9s, HoareTripleCheckerStatistics: 474 SDtfs, 1010 SDslu, 1150 SDs, 0 SdLazy, 12440 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 28 SyntacticMatches, 69 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1213occurred in iteration=31, 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, 21.2s InterpolantComputationTime, 834 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 417417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...