/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 16:51:28,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 16:51:28,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 16:51:28,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 16:51:28,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 16:51:28,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 16:51:28,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 16:51:28,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 16:51:28,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 16:51:28,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 16:51:28,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 16:51:28,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 16:51:28,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 16:51:28,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 16:51:28,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 16:51:28,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 16:51:28,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 16:51:28,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 16:51:28,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 16:51:28,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 16:51:28,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 16:51:28,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 16:51:28,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 16:51:28,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 16:51:28,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 16:51:28,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 16:51:28,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 16:51:28,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 16:51:28,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 16:51:28,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 16:51:28,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 16:51:28,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 16:51:28,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 16:51:28,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 16:51:28,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 16:51:28,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 16:51:28,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 16:51:28,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 16:51:28,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 16:51:28,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 16:51:28,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 16:51:28,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 16:51:28,493 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 16:51:28,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 16:51:28,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 16:51:28,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 16:51:28,496 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 16:51:28,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 16:51:28,497 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 16:51:28,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 16:51:28,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 16:51:28,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 16:51:28,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 16:51:28,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 16:51:28,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 16:51:28,499 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 16:51:28,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 16:51:28,500 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 16:51:28,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 16:51:28,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 16:51:28,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 16:51:28,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 16:51:28,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 16:51:28,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 16:51:28,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 16:51:28,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 16:51:28,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 16:51:28,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 16:51:28,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 16:51:28,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 16:51:28,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 16:51:28,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 16:51:28,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 16:51:28,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 16:51:28,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 16:51:28,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 16:51:28,798 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 16:51:28,798 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-11 16:51:28,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fe87343/662b60102a77414cba57ba628b60108c/FLAGc08228767 [2020-10-11 16:51:29,444 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 16:51:29,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-11 16:51:29,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fe87343/662b60102a77414cba57ba628b60108c/FLAGc08228767 [2020-10-11 16:51:29,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fe87343/662b60102a77414cba57ba628b60108c [2020-10-11 16:51:29,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 16:51:29,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 16:51:29,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 16:51:29,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 16:51:29,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 16:51:29,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:51:29" (1/1) ... [2020-10-11 16:51:29,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706b3994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:29, skipping insertion in model container [2020-10-11 16:51:29,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:51:29" (1/1) ... [2020-10-11 16:51:29,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 16:51:29,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 16:51:30,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:51:30,273 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 16:51:30,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 16:51:30,509 INFO L208 MainTranslator]: Completed translation [2020-10-11 16:51:30,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30 WrapperNode [2020-10-11 16:51:30,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 16:51:30,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 16:51:30,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 16:51:30,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 16:51:30,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 16:51:30,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 16:51:30,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 16:51:30,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 16:51:30,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... [2020-10-11 16:51:30,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 16:51:30,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 16:51:30,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 16:51:30,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 16:51:30,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 16:51:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 16:51:30,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 16:51:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-11 16:51:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-11 16:51:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-11 16:51:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-11 16:51:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-11 16:51:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-11 16:51:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-11 16:51:30,664 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-11 16:51:30,664 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-11 16:51:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 16:51:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-11 16:51:30,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 16:51:30,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 16:51:30,667 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 16:51:31,071 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 16:51:31,072 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-11 16:51:31,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:51:31 BoogieIcfgContainer [2020-10-11 16:51:31,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 16:51:31,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 16:51:31,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 16:51:31,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 16:51:31,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:51:29" (1/3) ... [2020-10-11 16:51:31,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d0d5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:51:31, skipping insertion in model container [2020-10-11 16:51:31,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:51:30" (2/3) ... [2020-10-11 16:51:31,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77d0d5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:51:31, skipping insertion in model container [2020-10-11 16:51:31,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:51:31" (3/3) ... [2020-10-11 16:51:31,083 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-11 16:51:31,095 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 16:51:31,103 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-11 16:51:31,105 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 16:51:31,143 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,143 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,143 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,144 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,144 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,145 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,145 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,145 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,146 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,153 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,154 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,155 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,156 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,163 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,163 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,163 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,163 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,164 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,164 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,164 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,165 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,165 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,165 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,165 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,166 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,166 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,167 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,168 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,168 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,168 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,168 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,169 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,169 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,169 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,170 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,170 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,170 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,170 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,171 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,171 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,171 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,172 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,172 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,176 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,176 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,177 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,177 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,185 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,185 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,186 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,186 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,189 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,189 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,189 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,189 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,196 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,196 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,197 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,197 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,202 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,202 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,202 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,203 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,203 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,203 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,205 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,206 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,206 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,206 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,208 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,209 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,209 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,209 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,212 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,212 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,213 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,213 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,215 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,215 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,216 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,216 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,218 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,218 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,219 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,221 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,222 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,222 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 16:51:31,381 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-11 16:51:31,400 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 16:51:31,400 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 16:51:31,401 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 16:51:31,401 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 16:51:31,401 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 16:51:31,401 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 16:51:31,401 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 16:51:31,401 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 16:51:31,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-11 16:51:31,515 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-11 16:51:31,515 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-11 16:51:31,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-10-11 16:51:31,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 243 transitions, 866 flow [2020-10-11 16:51:31,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 135 transitions, 423 flow [2020-10-11 16:51:31,549 INFO L129 PetriNetUnfolder]: 4/51 cut-off events. [2020-10-11 16:51:31,549 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2020-10-11 16:51:31,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:31,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:31,551 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash -876483343, now seen corresponding path program 1 times [2020-10-11 16:51:31,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:31,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697298473] [2020-10-11 16:51:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:31,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697298473] [2020-10-11 16:51:31,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:31,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:51:31,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686106430] [2020-10-11 16:51:31,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:51:31,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:51:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:51:34,880 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 254 [2020-10-11 16:51:34,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 135 transitions, 423 flow. Second operand 8 states. [2020-10-11 16:51:34,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:34,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 254 [2020-10-11 16:51:34,887 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:35,454 INFO L129 PetriNetUnfolder]: 891/2349 cut-off events. [2020-10-11 16:51:35,455 INFO L130 PetriNetUnfolder]: For 344/345 co-relation queries the response was YES. [2020-10-11 16:51:35,479 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2349 events. 891/2349 cut-off events. For 344/345 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17200 event pairs, 181 based on Foata normal form. 35/1938 useless extension candidates. Maximal degree in co-relation 3757. Up to 336 conditions per place. [2020-10-11 16:51:35,512 INFO L132 encePairwiseOnDemand]: 241/254 looper letters, 45 selfloop transitions, 12 changer transitions 3/166 dead transitions. [2020-10-11 16:51:35,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 166 transitions, 605 flow [2020-10-11 16:51:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 16:51:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 16:51:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2225 transitions. [2020-10-11 16:51:35,551 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8759842519685039 [2020-10-11 16:51:35,552 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2225 transitions. [2020-10-11 16:51:35,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2225 transitions. [2020-10-11 16:51:35,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:35,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2225 transitions. [2020-10-11 16:51:35,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 16:51:35,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 16:51:35,596 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 16:51:35,599 INFO L185 Difference]: Start difference. First operand has 114 places, 135 transitions, 423 flow. Second operand 10 states and 2225 transitions. [2020-10-11 16:51:35,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 166 transitions, 605 flow [2020-10-11 16:51:35,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 166 transitions, 503 flow, removed 0 selfloop flow, removed 12 redundant places. [2020-10-11 16:51:35,644 INFO L241 Difference]: Finished difference. Result has 116 places, 139 transitions, 375 flow [2020-10-11 16:51:35,652 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=375, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2020-10-11 16:51:35,657 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2020-10-11 16:51:35,657 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 375 flow [2020-10-11 16:51:35,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:51:35,657 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:35,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:35,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 16:51:35,658 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2015546447, now seen corresponding path program 2 times [2020-10-11 16:51:35,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:35,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274425332] [2020-10-11 16:51:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:35,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274425332] [2020-10-11 16:51:35,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:35,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 16:51:35,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307690691] [2020-10-11 16:51:35,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 16:51:35,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 16:51:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 16:51:36,723 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 254 [2020-10-11 16:51:36,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 375 flow. Second operand 5 states. [2020-10-11 16:51:36,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:36,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 254 [2020-10-11 16:51:36,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:37,054 INFO L129 PetriNetUnfolder]: 1126/2797 cut-off events. [2020-10-11 16:51:37,055 INFO L130 PetriNetUnfolder]: For 439/443 co-relation queries the response was YES. [2020-10-11 16:51:37,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3938 conditions, 2797 events. 1126/2797 cut-off events. For 439/443 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 20106 event pairs, 279 based on Foata normal form. 2/2166 useless extension candidates. Maximal degree in co-relation 3322. Up to 590 conditions per place. [2020-10-11 16:51:37,094 INFO L132 encePairwiseOnDemand]: 247/254 looper letters, 28 selfloop transitions, 6 changer transitions 2/151 dead transitions. [2020-10-11 16:51:37,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 480 flow [2020-10-11 16:51:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:51:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:51:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1418 transitions. [2020-10-11 16:51:37,099 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9304461942257218 [2020-10-11 16:51:37,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1418 transitions. [2020-10-11 16:51:37,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1418 transitions. [2020-10-11 16:51:37,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:37,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1418 transitions. [2020-10-11 16:51:37,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:51:37,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:51:37,108 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:51:37,109 INFO L185 Difference]: Start difference. First operand has 116 places, 139 transitions, 375 flow. Second operand 6 states and 1418 transitions. [2020-10-11 16:51:37,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 480 flow [2020-10-11 16:51:37,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 151 transitions, 469 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-11 16:51:37,118 INFO L241 Difference]: Finished difference. Result has 119 places, 141 transitions, 407 flow [2020-10-11 16:51:37,118 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=119, PETRI_TRANSITIONS=141} [2020-10-11 16:51:37,119 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2020-10-11 16:51:37,119 INFO L481 AbstractCegarLoop]: Abstraction has has 119 places, 141 transitions, 407 flow [2020-10-11 16:51:37,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 16:51:37,119 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:37,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:37,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 16:51:37,120 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:37,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:37,120 INFO L82 PathProgramCache]: Analyzing trace with hash 768479688, now seen corresponding path program 1 times [2020-10-11 16:51:37,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:37,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150467244] [2020-10-11 16:51:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:37,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-11 16:51:37,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150467244] [2020-10-11 16:51:37,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:37,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:51:37,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952452512] [2020-10-11 16:51:37,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:51:37,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:37,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:51:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:51:39,871 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 254 [2020-10-11 16:51:39,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 141 transitions, 407 flow. Second operand 8 states. [2020-10-11 16:51:39,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:39,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 254 [2020-10-11 16:51:39,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:40,363 INFO L129 PetriNetUnfolder]: 1344/3096 cut-off events. [2020-10-11 16:51:40,364 INFO L130 PetriNetUnfolder]: For 1096/1102 co-relation queries the response was YES. [2020-10-11 16:51:40,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 3096 events. 1344/3096 cut-off events. For 1096/1102 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22084 event pairs, 233 based on Foata normal form. 7/2403 useless extension candidates. Maximal degree in co-relation 4062. Up to 433 conditions per place. [2020-10-11 16:51:40,411 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 54 selfloop transitions, 23 changer transitions 0/181 dead transitions. [2020-10-11 16:51:40,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 181 transitions, 678 flow [2020-10-11 16:51:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 16:51:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 16:51:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2666 transitions. [2020-10-11 16:51:40,420 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8746719160104987 [2020-10-11 16:51:40,420 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2666 transitions. [2020-10-11 16:51:40,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2666 transitions. [2020-10-11 16:51:40,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:40,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2666 transitions. [2020-10-11 16:51:40,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 16:51:40,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 16:51:40,432 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 16:51:40,432 INFO L185 Difference]: Start difference. First operand has 119 places, 141 transitions, 407 flow. Second operand 12 states and 2666 transitions. [2020-10-11 16:51:40,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 181 transitions, 678 flow [2020-10-11 16:51:40,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 181 transitions, 660 flow, removed 6 selfloop flow, removed 2 redundant places. [2020-10-11 16:51:40,447 INFO L241 Difference]: Finished difference. Result has 130 places, 148 transitions, 503 flow [2020-10-11 16:51:40,447 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=503, PETRI_PLACES=130, PETRI_TRANSITIONS=148} [2020-10-11 16:51:40,447 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 16 predicate places. [2020-10-11 16:51:40,448 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 148 transitions, 503 flow [2020-10-11 16:51:40,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:51:40,448 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:40,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:40,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 16:51:40,448 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:40,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1717061704, now seen corresponding path program 1 times [2020-10-11 16:51:40,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:40,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643960016] [2020-10-11 16:51:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:40,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643960016] [2020-10-11 16:51:40,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:40,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 16:51:40,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068923413] [2020-10-11 16:51:40,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 16:51:40,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 16:51:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 16:51:41,381 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 254 [2020-10-11 16:51:41,382 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 148 transitions, 503 flow. Second operand 5 states. [2020-10-11 16:51:41,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:41,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 254 [2020-10-11 16:51:41,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:41,795 INFO L129 PetriNetUnfolder]: 1499/3641 cut-off events. [2020-10-11 16:51:41,795 INFO L130 PetriNetUnfolder]: For 1710/1715 co-relation queries the response was YES. [2020-10-11 16:51:41,823 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5561 conditions, 3641 events. 1499/3641 cut-off events. For 1710/1715 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 27862 event pairs, 399 based on Foata normal form. 17/2851 useless extension candidates. Maximal degree in co-relation 5149. Up to 850 conditions per place. [2020-10-11 16:51:41,853 INFO L132 encePairwiseOnDemand]: 247/254 looper letters, 32 selfloop transitions, 8 changer transitions 0/157 dead transitions. [2020-10-11 16:51:41,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 157 transitions, 608 flow [2020-10-11 16:51:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:51:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:51:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2020-10-11 16:51:41,858 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.926509186351706 [2020-10-11 16:51:41,859 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1412 transitions. [2020-10-11 16:51:41,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1412 transitions. [2020-10-11 16:51:41,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:41,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1412 transitions. [2020-10-11 16:51:41,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:51:41,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:51:41,869 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:51:41,869 INFO L185 Difference]: Start difference. First operand has 130 places, 148 transitions, 503 flow. Second operand 6 states and 1412 transitions. [2020-10-11 16:51:41,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 157 transitions, 608 flow [2020-10-11 16:51:41,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 157 transitions, 578 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-11 16:51:41,884 INFO L241 Difference]: Finished difference. Result has 133 places, 149 transitions, 504 flow [2020-10-11 16:51:41,885 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=133, PETRI_TRANSITIONS=149} [2020-10-11 16:51:41,885 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 19 predicate places. [2020-10-11 16:51:41,885 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 149 transitions, 504 flow [2020-10-11 16:51:41,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 16:51:41,886 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:41,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:41,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 16:51:41,887 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:41,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:41,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1636508354, now seen corresponding path program 2 times [2020-10-11 16:51:41,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:41,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707015310] [2020-10-11 16:51:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:41,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707015310] [2020-10-11 16:51:41,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:41,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 16:51:41,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761656428] [2020-10-11 16:51:41,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 16:51:41,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 16:51:41,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 16:51:42,440 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 254 [2020-10-11 16:51:42,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 149 transitions, 504 flow. Second operand 6 states. [2020-10-11 16:51:42,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:42,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 254 [2020-10-11 16:51:42,441 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:43,505 INFO L129 PetriNetUnfolder]: 3415/8029 cut-off events. [2020-10-11 16:51:43,505 INFO L130 PetriNetUnfolder]: For 614/616 co-relation queries the response was YES. [2020-10-11 16:51:43,554 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11367 conditions, 8029 events. 3415/8029 cut-off events. For 614/616 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 73359 event pairs, 115 based on Foata normal form. 2/6584 useless extension candidates. Maximal degree in co-relation 11086. Up to 1082 conditions per place. [2020-10-11 16:51:43,595 INFO L132 encePairwiseOnDemand]: 241/254 looper letters, 61 selfloop transitions, 50 changer transitions 0/237 dead transitions. [2020-10-11 16:51:43,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 237 transitions, 902 flow [2020-10-11 16:51:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 16:51:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 16:51:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3087 transitions. [2020-10-11 16:51:43,611 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9348879466989704 [2020-10-11 16:51:43,612 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3087 transitions. [2020-10-11 16:51:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3087 transitions. [2020-10-11 16:51:43,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:43,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3087 transitions. [2020-10-11 16:51:43,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 16:51:43,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 16:51:43,630 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 16:51:43,630 INFO L185 Difference]: Start difference. First operand has 133 places, 149 transitions, 504 flow. Second operand 13 states and 3087 transitions. [2020-10-11 16:51:43,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 237 transitions, 902 flow [2020-10-11 16:51:43,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 237 transitions, 888 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 16:51:43,644 INFO L241 Difference]: Finished difference. Result has 153 places, 199 transitions, 886 flow [2020-10-11 16:51:43,644 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=886, PETRI_PLACES=153, PETRI_TRANSITIONS=199} [2020-10-11 16:51:43,645 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2020-10-11 16:51:43,645 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 199 transitions, 886 flow [2020-10-11 16:51:43,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 16:51:43,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:43,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:43,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 16:51:43,646 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1426427066, now seen corresponding path program 1 times [2020-10-11 16:51:43,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:43,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701861181] [2020-10-11 16:51:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:43,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701861181] [2020-10-11 16:51:43,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:43,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:51:43,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209882649] [2020-10-11 16:51:43,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:51:43,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:51:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:51:46,003 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 254 [2020-10-11 16:51:46,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 199 transitions, 886 flow. Second operand 8 states. [2020-10-11 16:51:46,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:46,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 254 [2020-10-11 16:51:46,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:47,025 INFO L129 PetriNetUnfolder]: 3553/8395 cut-off events. [2020-10-11 16:51:47,025 INFO L130 PetriNetUnfolder]: For 20035/20586 co-relation queries the response was YES. [2020-10-11 16:51:47,085 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19985 conditions, 8395 events. 3553/8395 cut-off events. For 20035/20586 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 77397 event pairs, 251 based on Foata normal form. 115/6930 useless extension candidates. Maximal degree in co-relation 15490. Up to 1390 conditions per place. [2020-10-11 16:51:47,146 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 104 selfloop transitions, 23 changer transitions 0/240 dead transitions. [2020-10-11 16:51:47,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 240 transitions, 1467 flow [2020-10-11 16:51:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 16:51:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 16:51:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2210 transitions. [2020-10-11 16:51:47,153 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8700787401574803 [2020-10-11 16:51:47,153 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2210 transitions. [2020-10-11 16:51:47,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2210 transitions. [2020-10-11 16:51:47,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:47,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2210 transitions. [2020-10-11 16:51:47,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 16:51:47,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 16:51:47,165 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 16:51:47,165 INFO L185 Difference]: Start difference. First operand has 153 places, 199 transitions, 886 flow. Second operand 10 states and 2210 transitions. [2020-10-11 16:51:47,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 240 transitions, 1467 flow [2020-10-11 16:51:47,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 240 transitions, 1467 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-11 16:51:47,217 INFO L241 Difference]: Finished difference. Result has 164 places, 200 transitions, 954 flow [2020-10-11 16:51:47,218 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=954, PETRI_PLACES=164, PETRI_TRANSITIONS=200} [2020-10-11 16:51:47,218 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 50 predicate places. [2020-10-11 16:51:47,218 INFO L481 AbstractCegarLoop]: Abstraction has has 164 places, 200 transitions, 954 flow [2020-10-11 16:51:47,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:51:47,219 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:47,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 16:51:47,219 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1425244614, now seen corresponding path program 2 times [2020-10-11 16:51:47,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:47,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804619286] [2020-10-11 16:51:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:47,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804619286] [2020-10-11 16:51:47,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:47,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:51:47,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033966750] [2020-10-11 16:51:47,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:51:47,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:47,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:51:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:51:49,438 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 254 [2020-10-11 16:51:49,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 200 transitions, 954 flow. Second operand 10 states. [2020-10-11 16:51:49,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:49,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 254 [2020-10-11 16:51:49,441 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:50,853 INFO L129 PetriNetUnfolder]: 3638/8771 cut-off events. [2020-10-11 16:51:50,854 INFO L130 PetriNetUnfolder]: For 17852/18164 co-relation queries the response was YES. [2020-10-11 16:51:50,905 INFO L80 FinitePrefix]: Finished finitePrefix Result has 21088 conditions, 8771 events. 3638/8771 cut-off events. For 17852/18164 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 83003 event pairs, 137 based on Foata normal form. 111/7396 useless extension candidates. Maximal degree in co-relation 14723. Up to 1158 conditions per place. [2020-10-11 16:51:50,951 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 74 selfloop transitions, 62 changer transitions 39/295 dead transitions. [2020-10-11 16:51:50,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 295 transitions, 2166 flow [2020-10-11 16:51:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 16:51:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 16:51:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5057 transitions. [2020-10-11 16:51:50,963 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.904974946313529 [2020-10-11 16:51:50,963 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 5057 transitions. [2020-10-11 16:51:50,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 5057 transitions. [2020-10-11 16:51:50,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:50,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 5057 transitions. [2020-10-11 16:51:50,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 16:51:50,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 16:51:50,987 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 16:51:50,987 INFO L185 Difference]: Start difference. First operand has 164 places, 200 transitions, 954 flow. Second operand 22 states and 5057 transitions. [2020-10-11 16:51:50,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 295 transitions, 2166 flow [2020-10-11 16:51:51,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 295 transitions, 2131 flow, removed 0 selfloop flow, removed 7 redundant places. [2020-10-11 16:51:51,040 INFO L241 Difference]: Finished difference. Result has 186 places, 213 transitions, 1323 flow [2020-10-11 16:51:51,041 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1323, PETRI_PLACES=186, PETRI_TRANSITIONS=213} [2020-10-11 16:51:51,041 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 72 predicate places. [2020-10-11 16:51:51,041 INFO L481 AbstractCegarLoop]: Abstraction has has 186 places, 213 transitions, 1323 flow [2020-10-11 16:51:51,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:51:51,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:51,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:51,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 16:51:51,042 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1269346088, now seen corresponding path program 1 times [2020-10-11 16:51:51,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:51,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481027515] [2020-10-11 16:51:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:51,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481027515] [2020-10-11 16:51:51,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:51,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 16:51:51,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507668669] [2020-10-11 16:51:51,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 16:51:51,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:51,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 16:51:51,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 16:51:51,917 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 254 [2020-10-11 16:51:51,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 213 transitions, 1323 flow. Second operand 5 states. [2020-10-11 16:51:51,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:51,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 254 [2020-10-11 16:51:51,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:53,250 INFO L129 PetriNetUnfolder]: 3626/8677 cut-off events. [2020-10-11 16:51:53,250 INFO L130 PetriNetUnfolder]: For 27890/28690 co-relation queries the response was YES. [2020-10-11 16:51:53,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 22653 conditions, 8677 events. 3626/8677 cut-off events. For 27890/28690 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 81158 event pairs, 372 based on Foata normal form. 150/7079 useless extension candidates. Maximal degree in co-relation 19005. Up to 2125 conditions per place. [2020-10-11 16:51:53,371 INFO L132 encePairwiseOnDemand]: 247/254 looper letters, 93 selfloop transitions, 8 changer transitions 0/232 dead transitions. [2020-10-11 16:51:53,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 232 transitions, 1748 flow [2020-10-11 16:51:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:51:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:51:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1413 transitions. [2020-10-11 16:51:53,375 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9271653543307087 [2020-10-11 16:51:53,375 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1413 transitions. [2020-10-11 16:51:53,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1413 transitions. [2020-10-11 16:51:53,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:53,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1413 transitions. [2020-10-11 16:51:53,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:51:53,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:51:53,382 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:51:53,382 INFO L185 Difference]: Start difference. First operand has 186 places, 213 transitions, 1323 flow. Second operand 6 states and 1413 transitions. [2020-10-11 16:51:53,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 232 transitions, 1748 flow [2020-10-11 16:51:53,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 232 transitions, 1590 flow, removed 50 selfloop flow, removed 9 redundant places. [2020-10-11 16:51:53,468 INFO L241 Difference]: Finished difference. Result has 178 places, 214 transitions, 1203 flow [2020-10-11 16:51:53,468 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1203, PETRI_PLACES=178, PETRI_TRANSITIONS=214} [2020-10-11 16:51:53,469 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 64 predicate places. [2020-10-11 16:51:53,469 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 214 transitions, 1203 flow [2020-10-11 16:51:53,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 16:51:53,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:53,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:53,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 16:51:53,469 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1202320960, now seen corresponding path program 2 times [2020-10-11 16:51:53,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:53,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335955739] [2020-10-11 16:51:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:53,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-11 16:51:53,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335955739] [2020-10-11 16:51:53,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:53,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:51:53,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40859010] [2020-10-11 16:51:53,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:51:53,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:53,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:51:53,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:51:56,263 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 254 [2020-10-11 16:51:56,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 214 transitions, 1203 flow. Second operand 8 states. [2020-10-11 16:51:56,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:51:56,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 254 [2020-10-11 16:51:56,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:51:57,103 INFO L129 PetriNetUnfolder]: 3507/8257 cut-off events. [2020-10-11 16:51:57,104 INFO L130 PetriNetUnfolder]: For 28398/29179 co-relation queries the response was YES. [2020-10-11 16:51:57,167 INFO L80 FinitePrefix]: Finished finitePrefix Result has 22237 conditions, 8257 events. 3507/8257 cut-off events. For 28398/29179 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 76246 event pairs, 261 based on Foata normal form. 178/6879 useless extension candidates. Maximal degree in co-relation 15390. Up to 1347 conditions per place. [2020-10-11 16:51:57,411 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 120 selfloop transitions, 23 changer transitions 0/261 dead transitions. [2020-10-11 16:51:57,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 261 transitions, 1939 flow [2020-10-11 16:51:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 16:51:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 16:51:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2212 transitions. [2020-10-11 16:51:57,417 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8708661417322835 [2020-10-11 16:51:57,417 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2212 transitions. [2020-10-11 16:51:57,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2212 transitions. [2020-10-11 16:51:57,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:51:57,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2212 transitions. [2020-10-11 16:51:57,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 16:51:57,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 16:51:57,427 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 16:51:57,427 INFO L185 Difference]: Start difference. First operand has 178 places, 214 transitions, 1203 flow. Second operand 10 states and 2212 transitions. [2020-10-11 16:51:57,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 261 transitions, 1939 flow [2020-10-11 16:51:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 261 transitions, 1925 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 16:51:57,480 INFO L241 Difference]: Finished difference. Result has 185 places, 215 transitions, 1257 flow [2020-10-11 16:51:57,481 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1257, PETRI_PLACES=185, PETRI_TRANSITIONS=215} [2020-10-11 16:51:57,481 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 71 predicate places. [2020-10-11 16:51:57,481 INFO L481 AbstractCegarLoop]: Abstraction has has 185 places, 215 transitions, 1257 flow [2020-10-11 16:51:57,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:51:57,482 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:51:57,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:51:57,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 16:51:57,482 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:51:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:51:57,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1852330822, now seen corresponding path program 3 times [2020-10-11 16:51:57,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:51:57,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782142295] [2020-10-11 16:51:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:51:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:51:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:51:57,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782142295] [2020-10-11 16:51:57,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:51:57,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:51:57,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092117984] [2020-10-11 16:51:57,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:51:57,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:51:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:51:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:52:02,593 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 254 [2020-10-11 16:52:02,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 215 transitions, 1257 flow. Second operand 12 states. [2020-10-11 16:52:02,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:02,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 254 [2020-10-11 16:52:02,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:03,775 INFO L129 PetriNetUnfolder]: 4104/9635 cut-off events. [2020-10-11 16:52:03,776 INFO L130 PetriNetUnfolder]: For 33846/34902 co-relation queries the response was YES. [2020-10-11 16:52:03,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 26287 conditions, 9635 events. 4104/9635 cut-off events. For 33846/34902 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 90710 event pairs, 227 based on Foata normal form. 121/7854 useless extension candidates. Maximal degree in co-relation 18050. Up to 1436 conditions per place. [2020-10-11 16:52:03,900 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 148 selfloop transitions, 46 changer transitions 0/308 dead transitions. [2020-10-11 16:52:03,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 308 transitions, 2579 flow [2020-10-11 16:52:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 16:52:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 16:52:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3478 transitions. [2020-10-11 16:52:03,907 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8558070866141733 [2020-10-11 16:52:03,908 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3478 transitions. [2020-10-11 16:52:03,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3478 transitions. [2020-10-11 16:52:03,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:03,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3478 transitions. [2020-10-11 16:52:03,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 16:52:03,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 16:52:03,921 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 16:52:03,921 INFO L185 Difference]: Start difference. First operand has 185 places, 215 transitions, 1257 flow. Second operand 16 states and 3478 transitions. [2020-10-11 16:52:03,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 308 transitions, 2579 flow [2020-10-11 16:52:04,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 308 transitions, 2529 flow, removed 0 selfloop flow, removed 8 redundant places. [2020-10-11 16:52:04,010 INFO L241 Difference]: Finished difference. Result has 197 places, 240 transitions, 1686 flow [2020-10-11 16:52:04,011 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1686, PETRI_PLACES=197, PETRI_TRANSITIONS=240} [2020-10-11 16:52:04,011 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 83 predicate places. [2020-10-11 16:52:04,011 INFO L481 AbstractCegarLoop]: Abstraction has has 197 places, 240 transitions, 1686 flow [2020-10-11 16:52:04,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:52:04,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:04,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 16:52:04,012 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash -405558238, now seen corresponding path program 4 times [2020-10-11 16:52:04,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:04,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771025610] [2020-10-11 16:52:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:04,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771025610] [2020-10-11 16:52:04,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:04,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:52:04,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636933665] [2020-10-11 16:52:04,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:52:04,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:04,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:52:04,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:52:10,665 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 254 [2020-10-11 16:52:10,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 240 transitions, 1686 flow. Second operand 12 states. [2020-10-11 16:52:10,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:10,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 254 [2020-10-11 16:52:10,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:11,685 INFO L129 PetriNetUnfolder]: 4066/9450 cut-off events. [2020-10-11 16:52:11,685 INFO L130 PetriNetUnfolder]: For 41013/42112 co-relation queries the response was YES. [2020-10-11 16:52:11,760 INFO L80 FinitePrefix]: Finished finitePrefix Result has 27098 conditions, 9450 events. 4066/9450 cut-off events. For 41013/42112 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 88078 event pairs, 241 based on Foata normal form. 127/7687 useless extension candidates. Maximal degree in co-relation 18278. Up to 1795 conditions per place. [2020-10-11 16:52:11,801 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 141 selfloop transitions, 32 changer transitions 0/287 dead transitions. [2020-10-11 16:52:11,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 287 transitions, 2526 flow [2020-10-11 16:52:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 16:52:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 16:52:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2395 transitions. [2020-10-11 16:52:11,804 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.857193987115247 [2020-10-11 16:52:11,804 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2395 transitions. [2020-10-11 16:52:11,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2395 transitions. [2020-10-11 16:52:11,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:11,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2395 transitions. [2020-10-11 16:52:11,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 16:52:11,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 16:52:11,809 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 16:52:11,810 INFO L185 Difference]: Start difference. First operand has 197 places, 240 transitions, 1686 flow. Second operand 11 states and 2395 transitions. [2020-10-11 16:52:11,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 287 transitions, 2526 flow [2020-10-11 16:52:11,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 287 transitions, 2335 flow, removed 89 selfloop flow, removed 4 redundant places. [2020-10-11 16:52:11,916 INFO L241 Difference]: Finished difference. Result has 206 places, 245 transitions, 1656 flow [2020-10-11 16:52:11,917 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1656, PETRI_PLACES=206, PETRI_TRANSITIONS=245} [2020-10-11 16:52:11,917 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 92 predicate places. [2020-10-11 16:52:11,917 INFO L481 AbstractCegarLoop]: Abstraction has has 206 places, 245 transitions, 1656 flow [2020-10-11 16:52:11,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:52:11,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:11,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:11,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 16:52:11,918 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:11,918 INFO L82 PathProgramCache]: Analyzing trace with hash -344545821, now seen corresponding path program 1 times [2020-10-11 16:52:11,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:11,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357938791] [2020-10-11 16:52:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:12,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357938791] [2020-10-11 16:52:12,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:12,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:52:12,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624814706] [2020-10-11 16:52:12,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:52:12,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:52:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:52:23,712 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:52:23,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 245 transitions, 1656 flow. Second operand 15 states. [2020-10-11 16:52:23,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:23,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:52:23,715 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:25,758 INFO L129 PetriNetUnfolder]: 5453/12762 cut-off events. [2020-10-11 16:52:25,758 INFO L130 PetriNetUnfolder]: For 48981/50341 co-relation queries the response was YES. [2020-10-11 16:52:25,864 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33615 conditions, 12762 events. 5453/12762 cut-off events. For 48981/50341 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 125898 event pairs, 305 based on Foata normal form. 175/10241 useless extension candidates. Maximal degree in co-relation 33460. Up to 2004 conditions per place. [2020-10-11 16:52:25,914 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 211 selfloop transitions, 45 changer transitions 0/364 dead transitions. [2020-10-11 16:52:25,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 364 transitions, 3341 flow [2020-10-11 16:52:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 16:52:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 16:52:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3210 transitions. [2020-10-11 16:52:25,918 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.84251968503937 [2020-10-11 16:52:25,918 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3210 transitions. [2020-10-11 16:52:25,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3210 transitions. [2020-10-11 16:52:25,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:25,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3210 transitions. [2020-10-11 16:52:25,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 16:52:25,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 16:52:25,930 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 16:52:25,930 INFO L185 Difference]: Start difference. First operand has 206 places, 245 transitions, 1656 flow. Second operand 15 states and 3210 transitions. [2020-10-11 16:52:25,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 364 transitions, 3341 flow [2020-10-11 16:52:26,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 364 transitions, 3269 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-11 16:52:26,022 INFO L241 Difference]: Finished difference. Result has 218 places, 255 transitions, 1813 flow [2020-10-11 16:52:26,023 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1813, PETRI_PLACES=218, PETRI_TRANSITIONS=255} [2020-10-11 16:52:26,023 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 104 predicate places. [2020-10-11 16:52:26,023 INFO L481 AbstractCegarLoop]: Abstraction has has 218 places, 255 transitions, 1813 flow [2020-10-11 16:52:26,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:52:26,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:26,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:26,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 16:52:26,023 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -184459325, now seen corresponding path program 1 times [2020-10-11 16:52:26,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:26,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77373733] [2020-10-11 16:52:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:26,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77373733] [2020-10-11 16:52:26,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:26,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:52:26,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886027860] [2020-10-11 16:52:26,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:52:26,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:52:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:52:27,735 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 254 [2020-10-11 16:52:27,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 255 transitions, 1813 flow. Second operand 10 states. [2020-10-11 16:52:27,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:27,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 254 [2020-10-11 16:52:27,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:29,984 INFO L129 PetriNetUnfolder]: 6394/15226 cut-off events. [2020-10-11 16:52:29,985 INFO L130 PetriNetUnfolder]: For 49865/50740 co-relation queries the response was YES. [2020-10-11 16:52:30,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38794 conditions, 15226 events. 6394/15226 cut-off events. For 49865/50740 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 156940 event pairs, 107 based on Foata normal form. 202/12353 useless extension candidates. Maximal degree in co-relation 38661. Up to 2456 conditions per place. [2020-10-11 16:52:30,155 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 95 selfloop transitions, 69 changer transitions 35/351 dead transitions. [2020-10-11 16:52:30,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 351 transitions, 3415 flow [2020-10-11 16:52:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 16:52:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 16:52:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3703 transitions. [2020-10-11 16:52:30,160 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9111712598425197 [2020-10-11 16:52:30,160 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3703 transitions. [2020-10-11 16:52:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3703 transitions. [2020-10-11 16:52:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:30,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3703 transitions. [2020-10-11 16:52:30,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 16:52:30,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 16:52:30,167 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 16:52:30,167 INFO L185 Difference]: Start difference. First operand has 218 places, 255 transitions, 1813 flow. Second operand 16 states and 3703 transitions. [2020-10-11 16:52:30,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 351 transitions, 3415 flow [2020-10-11 16:52:30,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 351 transitions, 3357 flow, removed 6 selfloop flow, removed 9 redundant places. [2020-10-11 16:52:30,307 INFO L241 Difference]: Finished difference. Result has 234 places, 273 transitions, 2354 flow [2020-10-11 16:52:30,308 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2354, PETRI_PLACES=234, PETRI_TRANSITIONS=273} [2020-10-11 16:52:30,308 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 120 predicate places. [2020-10-11 16:52:30,308 INFO L481 AbstractCegarLoop]: Abstraction has has 234 places, 273 transitions, 2354 flow [2020-10-11 16:52:30,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:52:30,309 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:30,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:30,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 16:52:30,310 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2113610115, now seen corresponding path program 1 times [2020-10-11 16:52:30,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:30,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601241917] [2020-10-11 16:52:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:30,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601241917] [2020-10-11 16:52:30,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:30,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:52:30,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134058966] [2020-10-11 16:52:30,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:52:30,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:52:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:52:35,887 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 254 [2020-10-11 16:52:35,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 273 transitions, 2354 flow. Second operand 12 states. [2020-10-11 16:52:35,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:35,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 254 [2020-10-11 16:52:35,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:37,833 INFO L129 PetriNetUnfolder]: 5747/13440 cut-off events. [2020-10-11 16:52:37,833 INFO L130 PetriNetUnfolder]: For 85694/87526 co-relation queries the response was YES. [2020-10-11 16:52:38,009 INFO L80 FinitePrefix]: Finished finitePrefix Result has 41978 conditions, 13440 events. 5747/13440 cut-off events. For 85694/87526 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 133346 event pairs, 200 based on Foata normal form. 346/10959 useless extension candidates. Maximal degree in co-relation 41793. Up to 2113 conditions per place. [2020-10-11 16:52:38,071 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 188 selfloop transitions, 52 changer transitions 0/362 dead transitions. [2020-10-11 16:52:38,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 362 transitions, 4054 flow [2020-10-11 16:52:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 16:52:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 16:52:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3242 transitions. [2020-10-11 16:52:38,078 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8509186351706036 [2020-10-11 16:52:38,078 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3242 transitions. [2020-10-11 16:52:38,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3242 transitions. [2020-10-11 16:52:38,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:38,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3242 transitions. [2020-10-11 16:52:38,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 16:52:38,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 16:52:38,088 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 16:52:38,088 INFO L185 Difference]: Start difference. First operand has 234 places, 273 transitions, 2354 flow. Second operand 15 states and 3242 transitions. [2020-10-11 16:52:38,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 362 transitions, 4054 flow [2020-10-11 16:52:38,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 362 transitions, 3765 flow, removed 106 selfloop flow, removed 8 redundant places. [2020-10-11 16:52:38,323 INFO L241 Difference]: Finished difference. Result has 244 places, 288 transitions, 2487 flow [2020-10-11 16:52:38,324 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=2161, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2487, PETRI_PLACES=244, PETRI_TRANSITIONS=288} [2020-10-11 16:52:38,324 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 130 predicate places. [2020-10-11 16:52:38,324 INFO L481 AbstractCegarLoop]: Abstraction has has 244 places, 288 transitions, 2487 flow [2020-10-11 16:52:38,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:52:38,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:38,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 16:52:38,324 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:38,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:38,325 INFO L82 PathProgramCache]: Analyzing trace with hash 83073599, now seen corresponding path program 2 times [2020-10-11 16:52:38,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:38,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502187413] [2020-10-11 16:52:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:38,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502187413] [2020-10-11 16:52:38,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:38,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:52:38,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242635478] [2020-10-11 16:52:38,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:52:38,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:38,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:52:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:52:41,783 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 254 [2020-10-11 16:52:41,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 288 transitions, 2487 flow. Second operand 10 states. [2020-10-11 16:52:41,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:41,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 254 [2020-10-11 16:52:41,785 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:43,377 INFO L129 PetriNetUnfolder]: 5065/12078 cut-off events. [2020-10-11 16:52:43,377 INFO L130 PetriNetUnfolder]: For 55909/57331 co-relation queries the response was YES. [2020-10-11 16:52:43,536 INFO L80 FinitePrefix]: Finished finitePrefix Result has 32775 conditions, 12078 events. 5065/12078 cut-off events. For 55909/57331 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 118038 event pairs, 148 based on Foata normal form. 187/9463 useless extension candidates. Maximal degree in co-relation 32562. Up to 2022 conditions per place. [2020-10-11 16:52:43,589 INFO L132 encePairwiseOnDemand]: 241/254 looper letters, 159 selfloop transitions, 50 changer transitions 0/329 dead transitions. [2020-10-11 16:52:43,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 329 transitions, 3615 flow [2020-10-11 16:52:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 16:52:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 16:52:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3066 transitions. [2020-10-11 16:52:43,592 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8622047244094488 [2020-10-11 16:52:43,592 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3066 transitions. [2020-10-11 16:52:43,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3066 transitions. [2020-10-11 16:52:43,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:43,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3066 transitions. [2020-10-11 16:52:43,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 16:52:43,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 16:52:43,600 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 16:52:43,600 INFO L185 Difference]: Start difference. First operand has 244 places, 288 transitions, 2487 flow. Second operand 14 states and 3066 transitions. [2020-10-11 16:52:43,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 329 transitions, 3615 flow [2020-10-11 16:52:43,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 329 transitions, 3164 flow, removed 124 selfloop flow, removed 29 redundant places. [2020-10-11 16:52:43,756 INFO L241 Difference]: Finished difference. Result has 231 places, 257 transitions, 2024 flow [2020-10-11 16:52:43,757 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2024, PETRI_PLACES=231, PETRI_TRANSITIONS=257} [2020-10-11 16:52:43,757 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 117 predicate places. [2020-10-11 16:52:43,757 INFO L481 AbstractCegarLoop]: Abstraction has has 231 places, 257 transitions, 2024 flow [2020-10-11 16:52:43,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:52:43,757 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:43,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:43,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 16:52:43,758 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -883560567, now seen corresponding path program 1 times [2020-10-11 16:52:43,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:43,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348569105] [2020-10-11 16:52:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:44,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348569105] [2020-10-11 16:52:44,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:44,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 16:52:44,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711934067] [2020-10-11 16:52:44,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 16:52:44,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 16:52:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-11 16:52:55,074 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:52:55,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 257 transitions, 2024 flow. Second operand 16 states. [2020-10-11 16:52:55,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:52:55,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:52:55,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:52:57,507 INFO L129 PetriNetUnfolder]: 5407/12883 cut-off events. [2020-10-11 16:52:57,507 INFO L130 PetriNetUnfolder]: For 38467/39827 co-relation queries the response was YES. [2020-10-11 16:52:57,619 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31420 conditions, 12883 events. 5407/12883 cut-off events. For 38467/39827 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 126727 event pairs, 143 based on Foata normal form. 107/9972 useless extension candidates. Maximal degree in co-relation 31246. Up to 2182 conditions per place. [2020-10-11 16:52:57,665 INFO L132 encePairwiseOnDemand]: 235/254 looper letters, 150 selfloop transitions, 68 changer transitions 1/323 dead transitions. [2020-10-11 16:52:57,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 323 transitions, 3217 flow [2020-10-11 16:52:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:52:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:52:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3823 transitions. [2020-10-11 16:52:57,668 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8361767279090113 [2020-10-11 16:52:57,668 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3823 transitions. [2020-10-11 16:52:57,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3823 transitions. [2020-10-11 16:52:57,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:52:57,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3823 transitions. [2020-10-11 16:52:57,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:52:57,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:52:57,680 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:52:57,680 INFO L185 Difference]: Start difference. First operand has 231 places, 257 transitions, 2024 flow. Second operand 18 states and 3823 transitions. [2020-10-11 16:52:57,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 323 transitions, 3217 flow [2020-10-11 16:52:57,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 323 transitions, 3113 flow, removed 4 selfloop flow, removed 8 redundant places. [2020-10-11 16:52:57,792 INFO L241 Difference]: Finished difference. Result has 247 places, 276 transitions, 2388 flow [2020-10-11 16:52:57,793 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=1947, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2388, PETRI_PLACES=247, PETRI_TRANSITIONS=276} [2020-10-11 16:52:57,793 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 133 predicate places. [2020-10-11 16:52:57,793 INFO L481 AbstractCegarLoop]: Abstraction has has 247 places, 276 transitions, 2388 flow [2020-10-11 16:52:57,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 16:52:57,793 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:52:57,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:52:57,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 16:52:57,793 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:52:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:52:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2045814017, now seen corresponding path program 2 times [2020-10-11 16:52:57,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:52:57,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349959118] [2020-10-11 16:52:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:52:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:52:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:52:58,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349959118] [2020-10-11 16:52:58,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:52:58,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:52:58,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387870084] [2020-10-11 16:52:58,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:52:58,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:52:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:52:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:53:08,871 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:53:08,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 276 transitions, 2388 flow. Second operand 15 states. [2020-10-11 16:53:08,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:53:08,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:53:08,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:53:11,130 INFO L129 PetriNetUnfolder]: 6033/14295 cut-off events. [2020-10-11 16:53:11,130 INFO L130 PetriNetUnfolder]: For 41633/42776 co-relation queries the response was YES. [2020-10-11 16:53:11,342 INFO L80 FinitePrefix]: Finished finitePrefix Result has 34062 conditions, 14295 events. 6033/14295 cut-off events. For 41633/42776 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 142795 event pairs, 134 based on Foata normal form. 127/10894 useless extension candidates. Maximal degree in co-relation 33890. Up to 2486 conditions per place. [2020-10-11 16:53:11,402 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 158 selfloop transitions, 106 changer transitions 1/369 dead transitions. [2020-10-11 16:53:11,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 369 transitions, 3991 flow [2020-10-11 16:53:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-11 16:53:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-11 16:53:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4879 transitions. [2020-10-11 16:53:11,406 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8351591920575145 [2020-10-11 16:53:11,406 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4879 transitions. [2020-10-11 16:53:11,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4879 transitions. [2020-10-11 16:53:11,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:53:11,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4879 transitions. [2020-10-11 16:53:11,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-11 16:53:11,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-11 16:53:11,418 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-11 16:53:11,419 INFO L185 Difference]: Start difference. First operand has 247 places, 276 transitions, 2388 flow. Second operand 23 states and 4879 transitions. [2020-10-11 16:53:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 369 transitions, 3991 flow [2020-10-11 16:53:11,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 369 transitions, 3908 flow, removed 19 selfloop flow, removed 8 redundant places. [2020-10-11 16:53:11,564 INFO L241 Difference]: Finished difference. Result has 266 places, 302 transitions, 2945 flow [2020-10-11 16:53:11,564 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=2319, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2945, PETRI_PLACES=266, PETRI_TRANSITIONS=302} [2020-10-11 16:53:11,565 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 152 predicate places. [2020-10-11 16:53:11,565 INFO L481 AbstractCegarLoop]: Abstraction has has 266 places, 302 transitions, 2945 flow [2020-10-11 16:53:11,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:53:11,565 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:53:11,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:53:11,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 16:53:11,565 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:53:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:53:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash -35087169, now seen corresponding path program 3 times [2020-10-11 16:53:11,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:53:11,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27080540] [2020-10-11 16:53:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:53:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:53:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:53:11,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27080540] [2020-10-11 16:53:11,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:53:11,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:53:11,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811036949] [2020-10-11 16:53:11,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:53:11,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:53:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:53:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:53:22,033 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:53:22,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 302 transitions, 2945 flow. Second operand 15 states. [2020-10-11 16:53:22,035 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:53:22,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:53:22,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:53:24,009 INFO L129 PetriNetUnfolder]: 5850/13815 cut-off events. [2020-10-11 16:53:24,009 INFO L130 PetriNetUnfolder]: For 47060/48349 co-relation queries the response was YES. [2020-10-11 16:53:24,234 INFO L80 FinitePrefix]: Finished finitePrefix Result has 34803 conditions, 13815 events. 5850/13815 cut-off events. For 47060/48349 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 137201 event pairs, 146 based on Foata normal form. 126/10515 useless extension candidates. Maximal degree in co-relation 34614. Up to 2390 conditions per place. [2020-10-11 16:53:24,295 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 159 selfloop transitions, 77 changer transitions 0/340 dead transitions. [2020-10-11 16:53:24,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 340 transitions, 3855 flow [2020-10-11 16:53:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 16:53:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 16:53:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3608 transitions. [2020-10-11 16:53:24,299 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8355720240852247 [2020-10-11 16:53:24,300 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3608 transitions. [2020-10-11 16:53:24,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3608 transitions. [2020-10-11 16:53:24,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:53:24,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3608 transitions. [2020-10-11 16:53:24,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 16:53:24,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 16:53:24,305 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 16:53:24,306 INFO L185 Difference]: Start difference. First operand has 266 places, 302 transitions, 2945 flow. Second operand 17 states and 3608 transitions. [2020-10-11 16:53:24,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 340 transitions, 3855 flow [2020-10-11 16:53:24,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 340 transitions, 3752 flow, removed 21 selfloop flow, removed 11 redundant places. [2020-10-11 16:53:24,453 INFO L241 Difference]: Finished difference. Result has 272 places, 302 transitions, 3052 flow [2020-10-11 16:53:24,453 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3052, PETRI_PLACES=272, PETRI_TRANSITIONS=302} [2020-10-11 16:53:24,453 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 158 predicate places. [2020-10-11 16:53:24,454 INFO L481 AbstractCegarLoop]: Abstraction has has 272 places, 302 transitions, 3052 flow [2020-10-11 16:53:24,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:53:24,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:53:24,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:53:24,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 16:53:24,454 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:53:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:53:24,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2113700953, now seen corresponding path program 4 times [2020-10-11 16:53:24,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:53:24,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001574150] [2020-10-11 16:53:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:53:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:53:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:53:24,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001574150] [2020-10-11 16:53:24,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:53:24,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 16:53:24,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644061340] [2020-10-11 16:53:24,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 16:53:24,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:53:24,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 16:53:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-10-11 16:53:40,191 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:53:40,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 302 transitions, 3052 flow. Second operand 16 states. [2020-10-11 16:53:40,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:53:40,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:53:40,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:53:42,688 INFO L129 PetriNetUnfolder]: 5913/13972 cut-off events. [2020-10-11 16:53:42,688 INFO L130 PetriNetUnfolder]: For 48384/49618 co-relation queries the response was YES. [2020-10-11 16:53:42,902 INFO L80 FinitePrefix]: Finished finitePrefix Result has 35270 conditions, 13972 events. 5913/13972 cut-off events. For 48384/49618 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 139067 event pairs, 146 based on Foata normal form. 128/10637 useless extension candidates. Maximal degree in co-relation 35074. Up to 2414 conditions per place. [2020-10-11 16:53:42,962 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 153 selfloop transitions, 93 changer transitions 1/351 dead transitions. [2020-10-11 16:53:42,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 351 transitions, 4118 flow [2020-10-11 16:53:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:53:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:53:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3821 transitions. [2020-10-11 16:53:42,966 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8357392825896763 [2020-10-11 16:53:42,967 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3821 transitions. [2020-10-11 16:53:42,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3821 transitions. [2020-10-11 16:53:42,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:53:42,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3821 transitions. [2020-10-11 16:53:42,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:53:42,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:53:42,974 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:53:42,974 INFO L185 Difference]: Start difference. First operand has 272 places, 302 transitions, 3052 flow. Second operand 18 states and 3821 transitions. [2020-10-11 16:53:42,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 351 transitions, 4118 flow [2020-10-11 16:53:43,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 351 transitions, 4021 flow, removed 6 selfloop flow, removed 11 redundant places. [2020-10-11 16:53:43,123 INFO L241 Difference]: Finished difference. Result has 282 places, 308 transitions, 3287 flow [2020-10-11 16:53:43,124 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=2957, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3287, PETRI_PLACES=282, PETRI_TRANSITIONS=308} [2020-10-11 16:53:43,124 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 168 predicate places. [2020-10-11 16:53:43,124 INFO L481 AbstractCegarLoop]: Abstraction has has 282 places, 308 transitions, 3287 flow [2020-10-11 16:53:43,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 16:53:43,124 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:53:43,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:53:43,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 16:53:43,125 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:53:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:53:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1773119302, now seen corresponding path program 1 times [2020-10-11 16:53:43,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:53:43,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055059837] [2020-10-11 16:53:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:53:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:53:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:53:43,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055059837] [2020-10-11 16:53:43,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:53:43,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:53:43,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977610144] [2020-10-11 16:53:43,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:53:43,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:53:43,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:53:43,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:53:55,755 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:53:55,757 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 308 transitions, 3287 flow. Second operand 15 states. [2020-10-11 16:53:55,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:53:55,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:53:55,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:53:58,227 INFO L129 PetriNetUnfolder]: 6325/14875 cut-off events. [2020-10-11 16:53:58,227 INFO L130 PetriNetUnfolder]: For 54400/55796 co-relation queries the response was YES. [2020-10-11 16:53:58,491 INFO L80 FinitePrefix]: Finished finitePrefix Result has 37715 conditions, 14875 events. 6325/14875 cut-off events. For 54400/55796 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 148907 event pairs, 129 based on Foata normal form. 122/11253 useless extension candidates. Maximal degree in co-relation 37515. Up to 2592 conditions per place. [2020-10-11 16:53:58,568 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 165 selfloop transitions, 120 changer transitions 0/389 dead transitions. [2020-10-11 16:53:58,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 389 transitions, 4881 flow [2020-10-11 16:53:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-11 16:53:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-11 16:53:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4457 transitions. [2020-10-11 16:53:58,575 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8355830521184852 [2020-10-11 16:53:58,575 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4457 transitions. [2020-10-11 16:53:58,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4457 transitions. [2020-10-11 16:53:58,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:53:58,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4457 transitions. [2020-10-11 16:53:58,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 22 states. [2020-10-11 16:53:58,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 22 states. [2020-10-11 16:53:58,586 INFO L81 ComplementDD]: Finished complementDD. Result 22 states. [2020-10-11 16:53:58,587 INFO L185 Difference]: Start difference. First operand has 282 places, 308 transitions, 3287 flow. Second operand 21 states and 4457 transitions. [2020-10-11 16:53:58,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 389 transitions, 4881 flow [2020-10-11 16:53:58,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 389 transitions, 4649 flow, removed 42 selfloop flow, removed 13 redundant places. [2020-10-11 16:53:58,770 INFO L241 Difference]: Finished difference. Result has 293 places, 324 transitions, 3709 flow [2020-10-11 16:53:58,771 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3709, PETRI_PLACES=293, PETRI_TRANSITIONS=324} [2020-10-11 16:53:58,771 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 179 predicate places. [2020-10-11 16:53:58,771 INFO L481 AbstractCegarLoop]: Abstraction has has 293 places, 324 transitions, 3709 flow [2020-10-11 16:53:58,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:53:58,771 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:53:58,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:53:58,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 16:53:58,772 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:53:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:53:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash -604847385, now seen corresponding path program 5 times [2020-10-11 16:53:58,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:53:58,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116003909] [2020-10-11 16:53:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:53:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:53:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:53:59,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116003909] [2020-10-11 16:53:59,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:53:59,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:53:59,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538393356] [2020-10-11 16:53:59,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:53:59,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:53:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:53:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:54:12,187 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:54:12,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 324 transitions, 3709 flow. Second operand 15 states. [2020-10-11 16:54:12,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:54:12,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:54:12,190 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:54:14,423 INFO L129 PetriNetUnfolder]: 6278/14815 cut-off events. [2020-10-11 16:54:14,423 INFO L130 PetriNetUnfolder]: For 57877/59167 co-relation queries the response was YES. [2020-10-11 16:54:14,673 INFO L80 FinitePrefix]: Finished finitePrefix Result has 37673 conditions, 14815 events. 6278/14815 cut-off events. For 57877/59167 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 148792 event pairs, 142 based on Foata normal form. 124/11218 useless extension candidates. Maximal degree in co-relation 37466. Up to 2590 conditions per place. [2020-10-11 16:54:14,744 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 163 selfloop transitions, 91 changer transitions 0/358 dead transitions. [2020-10-11 16:54:14,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 358 transitions, 4561 flow [2020-10-11 16:54:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 16:54:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 16:54:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2766 transitions. [2020-10-11 16:54:14,747 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8376741368867353 [2020-10-11 16:54:14,747 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2766 transitions. [2020-10-11 16:54:14,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2766 transitions. [2020-10-11 16:54:14,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:54:14,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2766 transitions. [2020-10-11 16:54:14,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 16:54:14,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 16:54:14,752 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 16:54:14,753 INFO L185 Difference]: Start difference. First operand has 293 places, 324 transitions, 3709 flow. Second operand 13 states and 2766 transitions. [2020-10-11 16:54:14,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 358 transitions, 4561 flow [2020-10-11 16:54:14,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 358 transitions, 4469 flow, removed 18 selfloop flow, removed 12 redundant places. [2020-10-11 16:54:14,915 INFO L241 Difference]: Finished difference. Result has 294 places, 320 transitions, 3827 flow [2020-10-11 16:54:14,915 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3827, PETRI_PLACES=294, PETRI_TRANSITIONS=320} [2020-10-11 16:54:14,916 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 180 predicate places. [2020-10-11 16:54:14,916 INFO L481 AbstractCegarLoop]: Abstraction has has 294 places, 320 transitions, 3827 flow [2020-10-11 16:54:14,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:54:14,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:54:14,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:54:14,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 16:54:14,916 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:54:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:54:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1391569277, now seen corresponding path program 1 times [2020-10-11 16:54:14,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:54:14,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445289012] [2020-10-11 16:54:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:54:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:54:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:54:15,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445289012] [2020-10-11 16:54:15,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:54:15,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 16:54:15,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665804221] [2020-10-11 16:54:15,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 16:54:15,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:54:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 16:54:15,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-11 16:54:35,435 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 254 [2020-10-11 16:54:35,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 320 transitions, 3827 flow. Second operand 17 states. [2020-10-11 16:54:35,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:54:35,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 254 [2020-10-11 16:54:35,438 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:54:38,270 INFO L129 PetriNetUnfolder]: 5886/13900 cut-off events. [2020-10-11 16:54:38,271 INFO L130 PetriNetUnfolder]: For 58733/59886 co-relation queries the response was YES. [2020-10-11 16:54:38,447 INFO L80 FinitePrefix]: Finished finitePrefix Result has 35945 conditions, 13900 events. 5886/13900 cut-off events. For 58733/59886 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 137470 event pairs, 77 based on Foata normal form. 152/10637 useless extension candidates. Maximal degree in co-relation 35731. Up to 2402 conditions per place. [2020-10-11 16:54:38,501 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 165 selfloop transitions, 108 changer transitions 0/375 dead transitions. [2020-10-11 16:54:38,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 375 transitions, 4891 flow [2020-10-11 16:54:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:54:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:54:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3771 transitions. [2020-10-11 16:54:38,505 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8248031496062992 [2020-10-11 16:54:38,506 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3771 transitions. [2020-10-11 16:54:38,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3771 transitions. [2020-10-11 16:54:38,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:54:38,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3771 transitions. [2020-10-11 16:54:38,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:54:38,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:54:38,512 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:54:38,513 INFO L185 Difference]: Start difference. First operand has 294 places, 320 transitions, 3827 flow. Second operand 18 states and 3771 transitions. [2020-10-11 16:54:38,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 375 transitions, 4891 flow [2020-10-11 16:54:38,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 375 transitions, 4584 flow, removed 1 selfloop flow, removed 20 redundant places. [2020-10-11 16:54:38,733 INFO L241 Difference]: Finished difference. Result has 291 places, 321 transitions, 3696 flow [2020-10-11 16:54:38,734 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3462, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3696, PETRI_PLACES=291, PETRI_TRANSITIONS=321} [2020-10-11 16:54:38,734 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 177 predicate places. [2020-10-11 16:54:38,734 INFO L481 AbstractCegarLoop]: Abstraction has has 291 places, 321 transitions, 3696 flow [2020-10-11 16:54:38,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 16:54:38,734 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:54:38,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:54:38,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 16:54:38,734 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:54:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:54:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash 500637736, now seen corresponding path program 1 times [2020-10-11 16:54:38,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:54:38,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130459737] [2020-10-11 16:54:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:54:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:54:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:54:38,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130459737] [2020-10-11 16:54:38,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:54:38,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 16:54:38,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074129745] [2020-10-11 16:54:38,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 16:54:38,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:54:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 16:54:38,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 16:54:39,728 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 254 [2020-10-11 16:54:39,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 321 transitions, 3696 flow. Second operand 5 states. [2020-10-11 16:54:39,730 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:54:39,730 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 254 [2020-10-11 16:54:39,730 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:54:41,632 INFO L129 PetriNetUnfolder]: 7295/17289 cut-off events. [2020-10-11 16:54:41,632 INFO L130 PetriNetUnfolder]: For 61230/61943 co-relation queries the response was YES. [2020-10-11 16:54:41,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 41017 conditions, 17289 events. 7295/17289 cut-off events. For 61230/61943 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 177532 event pairs, 358 based on Foata normal form. 90/13174 useless extension candidates. Maximal degree in co-relation 40851. Up to 3265 conditions per place. [2020-10-11 16:54:41,984 INFO L132 encePairwiseOnDemand]: 247/254 looper letters, 183 selfloop transitions, 10 changer transitions 0/356 dead transitions. [2020-10-11 16:54:41,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 356 transitions, 4688 flow [2020-10-11 16:54:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:54:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:54:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions. [2020-10-11 16:54:41,986 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9278215223097113 [2020-10-11 16:54:41,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1414 transitions. [2020-10-11 16:54:41,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1414 transitions. [2020-10-11 16:54:41,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:54:41,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1414 transitions. [2020-10-11 16:54:41,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:54:41,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:54:41,988 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:54:41,988 INFO L185 Difference]: Start difference. First operand has 291 places, 321 transitions, 3696 flow. Second operand 6 states and 1414 transitions. [2020-10-11 16:54:41,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 356 transitions, 4688 flow [2020-10-11 16:54:42,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 356 transitions, 4556 flow, removed 4 selfloop flow, removed 12 redundant places. [2020-10-11 16:54:42,178 INFO L241 Difference]: Finished difference. Result has 286 places, 322 transitions, 3605 flow [2020-10-11 16:54:42,178 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3571, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3605, PETRI_PLACES=286, PETRI_TRANSITIONS=322} [2020-10-11 16:54:42,179 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 172 predicate places. [2020-10-11 16:54:42,179 INFO L481 AbstractCegarLoop]: Abstraction has has 286 places, 322 transitions, 3605 flow [2020-10-11 16:54:42,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 16:54:42,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:54:42,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:54:42,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 16:54:42,179 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:54:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:54:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2073687194, now seen corresponding path program 2 times [2020-10-11 16:54:42,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:54:42,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912523587] [2020-10-11 16:54:42,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:54:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:54:42,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-11 16:54:42,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912523587] [2020-10-11 16:54:42,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:54:42,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:54:42,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624690872] [2020-10-11 16:54:42,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:54:42,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:54:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:54:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:54:45,725 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 254 [2020-10-11 16:54:45,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 322 transitions, 3605 flow. Second operand 8 states. [2020-10-11 16:54:45,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:54:45,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 254 [2020-10-11 16:54:45,727 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:54:47,902 INFO L129 PetriNetUnfolder]: 7002/16477 cut-off events. [2020-10-11 16:54:47,902 INFO L130 PetriNetUnfolder]: For 61228/62026 co-relation queries the response was YES. [2020-10-11 16:54:48,163 INFO L80 FinitePrefix]: Finished finitePrefix Result has 40193 conditions, 16477 events. 7002/16477 cut-off events. For 61228/62026 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 167306 event pairs, 297 based on Foata normal form. 113/12609 useless extension candidates. Maximal degree in co-relation 40006. Up to 2938 conditions per place. [2020-10-11 16:54:48,229 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 199 selfloop transitions, 45 changer transitions 0/376 dead transitions. [2020-10-11 16:54:48,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 376 transitions, 4835 flow [2020-10-11 16:54:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 16:54:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 16:54:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2210 transitions. [2020-10-11 16:54:48,231 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8700787401574803 [2020-10-11 16:54:48,232 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2210 transitions. [2020-10-11 16:54:48,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2210 transitions. [2020-10-11 16:54:48,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:54:48,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2210 transitions. [2020-10-11 16:54:48,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 16:54:48,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 16:54:48,235 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 16:54:48,235 INFO L185 Difference]: Start difference. First operand has 286 places, 322 transitions, 3605 flow. Second operand 10 states and 2210 transitions. [2020-10-11 16:54:48,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 376 transitions, 4835 flow [2020-10-11 16:54:48,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 376 transitions, 4815 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 16:54:48,421 INFO L241 Difference]: Finished difference. Result has 293 places, 323 transitions, 3699 flow [2020-10-11 16:54:48,421 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3585, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3699, PETRI_PLACES=293, PETRI_TRANSITIONS=323} [2020-10-11 16:54:48,422 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 179 predicate places. [2020-10-11 16:54:48,422 INFO L481 AbstractCegarLoop]: Abstraction has has 293 places, 323 transitions, 3699 flow [2020-10-11 16:54:48,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:54:48,422 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:54:48,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:54:48,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-11 16:54:48,422 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:54:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:54:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1806234768, now seen corresponding path program 3 times [2020-10-11 16:54:48,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:54:48,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980751530] [2020-10-11 16:54:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:54:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:54:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:54:48,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980751530] [2020-10-11 16:54:48,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:54:48,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:54:48,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561072241] [2020-10-11 16:54:48,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:54:48,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:54:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:54:48,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:54:53,573 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 254 [2020-10-11 16:54:53,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 323 transitions, 3699 flow. Second operand 10 states. [2020-10-11 16:54:53,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:54:53,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 254 [2020-10-11 16:54:53,575 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:54:56,002 INFO L129 PetriNetUnfolder]: 6662/15847 cut-off events. [2020-10-11 16:54:56,003 INFO L130 PetriNetUnfolder]: For 61588/62306 co-relation queries the response was YES. [2020-10-11 16:54:56,218 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38947 conditions, 15847 events. 6662/15847 cut-off events. For 61588/62306 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 160968 event pairs, 247 based on Foata normal form. 113/12171 useless extension candidates. Maximal degree in co-relation 38750. Up to 2834 conditions per place. [2020-10-11 16:54:56,279 INFO L132 encePairwiseOnDemand]: 240/254 looper letters, 187 selfloop transitions, 60 changer transitions 0/376 dead transitions. [2020-10-11 16:54:56,279 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 376 transitions, 4904 flow [2020-10-11 16:54:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 16:54:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 16:54:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3052 transitions. [2020-10-11 16:54:56,282 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8582677165354331 [2020-10-11 16:54:56,283 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3052 transitions. [2020-10-11 16:54:56,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3052 transitions. [2020-10-11 16:54:56,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:54:56,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3052 transitions. [2020-10-11 16:54:56,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 16:54:56,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 16:54:56,288 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 16:54:56,288 INFO L185 Difference]: Start difference. First operand has 293 places, 323 transitions, 3699 flow. Second operand 14 states and 3052 transitions. [2020-10-11 16:54:56,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 376 transitions, 4904 flow [2020-10-11 16:54:56,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 376 transitions, 4814 flow, removed 0 selfloop flow, removed 8 redundant places. [2020-10-11 16:54:56,524 INFO L241 Difference]: Finished difference. Result has 300 places, 324 transitions, 3765 flow [2020-10-11 16:54:56,525 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3609, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3765, PETRI_PLACES=300, PETRI_TRANSITIONS=324} [2020-10-11 16:54:56,525 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 186 predicate places. [2020-10-11 16:54:56,525 INFO L481 AbstractCegarLoop]: Abstraction has has 300 places, 324 transitions, 3765 flow [2020-10-11 16:54:56,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:54:56,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:54:56,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:54:56,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-11 16:54:56,526 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:54:56,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:54:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1420240778, now seen corresponding path program 4 times [2020-10-11 16:54:56,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:54:56,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460656995] [2020-10-11 16:54:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:54:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:54:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:54:56,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460656995] [2020-10-11 16:54:56,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:54:56,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:54:56,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341611827] [2020-10-11 16:54:56,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:54:56,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:54:56,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:54:56,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:55:04,586 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 254 [2020-10-11 16:55:04,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 324 transitions, 3765 flow. Second operand 12 states. [2020-10-11 16:55:04,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:55:04,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 254 [2020-10-11 16:55:04,588 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:55:07,013 INFO L129 PetriNetUnfolder]: 6283/15136 cut-off events. [2020-10-11 16:55:07,013 INFO L130 PetriNetUnfolder]: For 60018/60563 co-relation queries the response was YES. [2020-10-11 16:55:07,220 INFO L80 FinitePrefix]: Finished finitePrefix Result has 37381 conditions, 15136 events. 6283/15136 cut-off events. For 60018/60563 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 153748 event pairs, 186 based on Foata normal form. 81/11673 useless extension candidates. Maximal degree in co-relation 37174. Up to 2682 conditions per place. [2020-10-11 16:55:07,276 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 172 selfloop transitions, 77 changer transitions 0/374 dead transitions. [2020-10-11 16:55:07,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 374 transitions, 4885 flow [2020-10-11 16:55:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 16:55:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 16:55:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3457 transitions. [2020-10-11 16:55:07,279 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8506397637795275 [2020-10-11 16:55:07,279 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3457 transitions. [2020-10-11 16:55:07,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3457 transitions. [2020-10-11 16:55:07,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:55:07,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3457 transitions. [2020-10-11 16:55:07,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 16:55:07,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 16:55:07,283 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 16:55:07,284 INFO L185 Difference]: Start difference. First operand has 300 places, 324 transitions, 3765 flow. Second operand 16 states and 3457 transitions. [2020-10-11 16:55:07,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 374 transitions, 4885 flow [2020-10-11 16:55:07,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 374 transitions, 4755 flow, removed 4 selfloop flow, removed 13 redundant places. [2020-10-11 16:55:07,436 INFO L241 Difference]: Finished difference. Result has 304 places, 325 transitions, 3839 flow [2020-10-11 16:55:07,436 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3635, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3839, PETRI_PLACES=304, PETRI_TRANSITIONS=325} [2020-10-11 16:55:07,436 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 190 predicate places. [2020-10-11 16:55:07,436 INFO L481 AbstractCegarLoop]: Abstraction has has 304 places, 325 transitions, 3839 flow [2020-10-11 16:55:07,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:55:07,436 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:55:07,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:55:07,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-11 16:55:07,437 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:55:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:55:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash -574977626, now seen corresponding path program 5 times [2020-10-11 16:55:07,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:55:07,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703463032] [2020-10-11 16:55:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:55:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:55:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:55:07,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703463032] [2020-10-11 16:55:07,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:55:07,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 16:55:07,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180329598] [2020-10-11 16:55:07,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 16:55:07,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:55:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 16:55:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-10-11 16:55:25,994 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 254 [2020-10-11 16:55:25,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 325 transitions, 3839 flow. Second operand 17 states. [2020-10-11 16:55:25,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:55:25,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 254 [2020-10-11 16:55:25,997 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:55:28,611 INFO L129 PetriNetUnfolder]: 6721/16169 cut-off events. [2020-10-11 16:55:28,611 INFO L130 PetriNetUnfolder]: For 64324/64739 co-relation queries the response was YES. [2020-10-11 16:55:28,883 INFO L80 FinitePrefix]: Finished finitePrefix Result has 39758 conditions, 16169 events. 6721/16169 cut-off events. For 64324/64739 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 165473 event pairs, 70 based on Foata normal form. 85/12631 useless extension candidates. Maximal degree in co-relation 39543. Up to 2894 conditions per place. [2020-10-11 16:55:28,931 INFO L132 encePairwiseOnDemand]: 237/254 looper letters, 232 selfloop transitions, 66 changer transitions 8/420 dead transitions. [2020-10-11 16:55:28,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 420 transitions, 5611 flow [2020-10-11 16:55:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 16:55:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 16:55:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3164 transitions. [2020-10-11 16:55:28,934 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8304461942257217 [2020-10-11 16:55:28,934 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3164 transitions. [2020-10-11 16:55:28,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3164 transitions. [2020-10-11 16:55:28,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:55:28,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3164 transitions. [2020-10-11 16:55:28,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 16:55:28,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 16:55:28,938 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 16:55:28,938 INFO L185 Difference]: Start difference. First operand has 304 places, 325 transitions, 3839 flow. Second operand 15 states and 3164 transitions. [2020-10-11 16:55:28,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 420 transitions, 5611 flow [2020-10-11 16:55:29,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 420 transitions, 5469 flow, removed 7 selfloop flow, removed 13 redundant places. [2020-10-11 16:55:29,157 INFO L241 Difference]: Finished difference. Result has 310 places, 341 transitions, 4088 flow [2020-10-11 16:55:29,157 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3710, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4088, PETRI_PLACES=310, PETRI_TRANSITIONS=341} [2020-10-11 16:55:29,158 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 196 predicate places. [2020-10-11 16:55:29,158 INFO L481 AbstractCegarLoop]: Abstraction has has 310 places, 341 transitions, 4088 flow [2020-10-11 16:55:29,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 16:55:29,158 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:55:29,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:55:29,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-11 16:55:29,158 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:55:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:55:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -250380298, now seen corresponding path program 1 times [2020-10-11 16:55:29,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:55:29,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030613339] [2020-10-11 16:55:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:55:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:55:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:55:29,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030613339] [2020-10-11 16:55:29,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:55:29,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 16:55:29,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770069644] [2020-10-11 16:55:29,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 16:55:29,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:55:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 16:55:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-11 16:55:38,585 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 254 [2020-10-11 16:55:38,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 341 transitions, 4088 flow. Second operand 14 states. [2020-10-11 16:55:38,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:55:38,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 254 [2020-10-11 16:55:38,588 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:55:41,225 INFO L129 PetriNetUnfolder]: 6975/16906 cut-off events. [2020-10-11 16:55:41,225 INFO L130 PetriNetUnfolder]: For 68443/68905 co-relation queries the response was YES. [2020-10-11 16:55:41,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 41462 conditions, 16906 events. 6975/16906 cut-off events. For 68443/68905 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 176422 event pairs, 112 based on Foata normal form. 77/12924 useless extension candidates. Maximal degree in co-relation 41253. Up to 3066 conditions per place. [2020-10-11 16:55:41,565 INFO L132 encePairwiseOnDemand]: 237/254 looper letters, 204 selfloop transitions, 102 changer transitions 0/428 dead transitions. [2020-10-11 16:55:41,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 428 transitions, 5849 flow [2020-10-11 16:55:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:55:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:55:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3869 transitions. [2020-10-11 16:55:41,569 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8462379702537183 [2020-10-11 16:55:41,569 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3869 transitions. [2020-10-11 16:55:41,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3869 transitions. [2020-10-11 16:55:41,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:55:41,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3869 transitions. [2020-10-11 16:55:41,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:55:41,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:55:41,574 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:55:41,574 INFO L185 Difference]: Start difference. First operand has 310 places, 341 transitions, 4088 flow. Second operand 18 states and 3869 transitions. [2020-10-11 16:55:41,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 428 transitions, 5849 flow [2020-10-11 16:55:41,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 428 transitions, 5758 flow, removed 27 selfloop flow, removed 7 redundant places. [2020-10-11 16:55:41,786 INFO L241 Difference]: Finished difference. Result has 327 places, 366 transitions, 4826 flow [2020-10-11 16:55:41,786 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=3996, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4826, PETRI_PLACES=327, PETRI_TRANSITIONS=366} [2020-10-11 16:55:41,786 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 213 predicate places. [2020-10-11 16:55:41,786 INFO L481 AbstractCegarLoop]: Abstraction has has 327 places, 366 transitions, 4826 flow [2020-10-11 16:55:41,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 16:55:41,787 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:55:41,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:55:41,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-11 16:55:41,787 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:55:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:55:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash -275056096, now seen corresponding path program 1 times [2020-10-11 16:55:41,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:55:41,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560819983] [2020-10-11 16:55:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:55:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:55:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:55:41,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560819983] [2020-10-11 16:55:41,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:55:41,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:55:41,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619039215] [2020-10-11 16:55:41,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:55:41,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:55:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:55:41,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:55:44,532 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 254 [2020-10-11 16:55:44,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 366 transitions, 4826 flow. Second operand 10 states. [2020-10-11 16:55:44,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:55:44,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 254 [2020-10-11 16:55:44,534 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:55:47,617 INFO L129 PetriNetUnfolder]: 7624/18588 cut-off events. [2020-10-11 16:55:47,617 INFO L130 PetriNetUnfolder]: For 77880/78609 co-relation queries the response was YES. [2020-10-11 16:55:47,961 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44537 conditions, 18588 events. 7624/18588 cut-off events. For 77880/78609 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 197994 event pairs, 44 based on Foata normal form. 291/14455 useless extension candidates. Maximal degree in co-relation 44388. Up to 3562 conditions per place. [2020-10-11 16:55:47,998 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 119 selfloop transitions, 141 changer transitions 57/511 dead transitions. [2020-10-11 16:55:47,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 511 transitions, 7661 flow [2020-10-11 16:55:47,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 16:55:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 16:55:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4792 transitions. [2020-10-11 16:55:48,002 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8575518969219756 [2020-10-11 16:55:48,002 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4792 transitions. [2020-10-11 16:55:48,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4792 transitions. [2020-10-11 16:55:48,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:55:48,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4792 transitions. [2020-10-11 16:55:48,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 16:55:48,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 16:55:48,007 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 16:55:48,007 INFO L185 Difference]: Start difference. First operand has 327 places, 366 transitions, 4826 flow. Second operand 22 states and 4792 transitions. [2020-10-11 16:55:48,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 511 transitions, 7661 flow [2020-10-11 16:55:48,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 511 transitions, 7480 flow, removed 57 selfloop flow, removed 8 redundant places. [2020-10-11 16:55:48,256 INFO L241 Difference]: Finished difference. Result has 350 places, 405 transitions, 5588 flow [2020-10-11 16:55:48,257 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4666, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5588, PETRI_PLACES=350, PETRI_TRANSITIONS=405} [2020-10-11 16:55:48,257 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 236 predicate places. [2020-10-11 16:55:48,258 INFO L481 AbstractCegarLoop]: Abstraction has has 350 places, 405 transitions, 5588 flow [2020-10-11 16:55:48,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:55:48,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:55:48,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:55:48,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-11 16:55:48,258 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:55:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:55:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1996542179, now seen corresponding path program 1 times [2020-10-11 16:55:48,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:55:48,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334113025] [2020-10-11 16:55:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:55:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:55:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:55:48,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334113025] [2020-10-11 16:55:48,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:55:48,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:55:48,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117713995] [2020-10-11 16:55:48,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:55:48,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:55:48,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:55:48,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:56:03,711 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:56:03,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 405 transitions, 5588 flow. Second operand 15 states. [2020-10-11 16:56:03,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:56:03,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:56:03,713 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:56:06,814 INFO L129 PetriNetUnfolder]: 6847/16539 cut-off events. [2020-10-11 16:56:06,814 INFO L130 PetriNetUnfolder]: For 89170/89943 co-relation queries the response was YES. [2020-10-11 16:56:07,164 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42715 conditions, 16539 events. 6847/16539 cut-off events. For 89170/89943 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 173132 event pairs, 99 based on Foata normal form. 195/12669 useless extension candidates. Maximal degree in co-relation 42569. Up to 3194 conditions per place. [2020-10-11 16:56:07,234 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 198 selfloop transitions, 114 changer transitions 0/442 dead transitions. [2020-10-11 16:56:07,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 442 transitions, 6800 flow [2020-10-11 16:56:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:56:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:56:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3807 transitions. [2020-10-11 16:56:07,237 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8326771653543307 [2020-10-11 16:56:07,237 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3807 transitions. [2020-10-11 16:56:07,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3807 transitions. [2020-10-11 16:56:07,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:56:07,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3807 transitions. [2020-10-11 16:56:07,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:56:07,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:56:07,243 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:56:07,243 INFO L185 Difference]: Start difference. First operand has 350 places, 405 transitions, 5588 flow. Second operand 18 states and 3807 transitions. [2020-10-11 16:56:07,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 442 transitions, 6800 flow [2020-10-11 16:56:07,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 442 transitions, 6516 flow, removed 84 selfloop flow, removed 11 redundant places. [2020-10-11 16:56:07,600 INFO L241 Difference]: Finished difference. Result has 357 places, 406 transitions, 5624 flow [2020-10-11 16:56:07,600 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5624, PETRI_PLACES=357, PETRI_TRANSITIONS=406} [2020-10-11 16:56:07,601 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 243 predicate places. [2020-10-11 16:56:07,601 INFO L481 AbstractCegarLoop]: Abstraction has has 357 places, 406 transitions, 5624 flow [2020-10-11 16:56:07,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:56:07,601 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:56:07,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:56:07,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-11 16:56:07,601 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:56:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:56:07,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1806487661, now seen corresponding path program 2 times [2020-10-11 16:56:07,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:56:07,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760416817] [2020-10-11 16:56:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:56:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:56:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:56:08,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760416817] [2020-10-11 16:56:08,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:56:08,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 16:56:08,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728656533] [2020-10-11 16:56:08,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 16:56:08,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:56:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 16:56:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-10-11 16:56:28,283 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 254 [2020-10-11 16:56:28,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 406 transitions, 5624 flow. Second operand 17 states. [2020-10-11 16:56:28,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:56:28,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 254 [2020-10-11 16:56:28,286 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:56:32,103 INFO L129 PetriNetUnfolder]: 7008/16961 cut-off events. [2020-10-11 16:56:32,104 INFO L130 PetriNetUnfolder]: For 82098/82852 co-relation queries the response was YES. [2020-10-11 16:56:32,422 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42290 conditions, 16961 events. 7008/16961 cut-off events. For 82098/82852 co-relation queries the response was YES. Maximal size of possible extension queue 1007. Compared 177172 event pairs, 55 based on Foata normal form. 171/13084 useless extension candidates. Maximal degree in co-relation 42145. Up to 3314 conditions per place. [2020-10-11 16:56:32,487 INFO L132 encePairwiseOnDemand]: 238/254 looper letters, 207 selfloop transitions, 132 changer transitions 0/462 dead transitions. [2020-10-11 16:56:32,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 462 transitions, 7237 flow [2020-10-11 16:56:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 16:56:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 16:56:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4618 transitions. [2020-10-11 16:56:32,491 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8264137437365784 [2020-10-11 16:56:32,491 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4618 transitions. [2020-10-11 16:56:32,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4618 transitions. [2020-10-11 16:56:32,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:56:32,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4618 transitions. [2020-10-11 16:56:32,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 16:56:32,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 16:56:32,497 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 16:56:32,497 INFO L185 Difference]: Start difference. First operand has 357 places, 406 transitions, 5624 flow. Second operand 22 states and 4618 transitions. [2020-10-11 16:56:32,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 462 transitions, 7237 flow [2020-10-11 16:56:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 462 transitions, 6953 flow, removed 18 selfloop flow, removed 20 redundant places. [2020-10-11 16:56:32,760 INFO L241 Difference]: Finished difference. Result has 362 places, 395 transitions, 5647 flow [2020-10-11 16:56:32,760 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=5007, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5647, PETRI_PLACES=362, PETRI_TRANSITIONS=395} [2020-10-11 16:56:32,760 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 248 predicate places. [2020-10-11 16:56:32,760 INFO L481 AbstractCegarLoop]: Abstraction has has 362 places, 395 transitions, 5647 flow [2020-10-11 16:56:32,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 16:56:32,761 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:56:32,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:56:32,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-11 16:56:32,761 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:56:32,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:56:32,761 INFO L82 PathProgramCache]: Analyzing trace with hash -501021507, now seen corresponding path program 1 times [2020-10-11 16:56:32,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:56:32,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495672823] [2020-10-11 16:56:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:56:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:56:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:56:33,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495672823] [2020-10-11 16:56:33,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:56:33,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-11 16:56:33,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107944154] [2020-10-11 16:56:33,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 16:56:33,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:56:33,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 16:56:33,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-10-11 16:57:03,278 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 254 [2020-10-11 16:57:03,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 395 transitions, 5647 flow. Second operand 19 states. [2020-10-11 16:57:03,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:03,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 254 [2020-10-11 16:57:03,281 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:06,582 INFO L129 PetriNetUnfolder]: 6282/15329 cut-off events. [2020-10-11 16:57:06,582 INFO L130 PetriNetUnfolder]: For 75521/76123 co-relation queries the response was YES. [2020-10-11 16:57:06,876 INFO L80 FinitePrefix]: Finished finitePrefix Result has 37118 conditions, 15329 events. 6282/15329 cut-off events. For 75521/76123 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 157698 event pairs, 11 based on Foata normal form. 149/11702 useless extension candidates. Maximal degree in co-relation 36972. Up to 3044 conditions per place. [2020-10-11 16:57:06,909 INFO L132 encePairwiseOnDemand]: 235/254 looper letters, 176 selfloop transitions, 101 changer transitions 11/400 dead transitions. [2020-10-11 16:57:06,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 400 transitions, 6500 flow [2020-10-11 16:57:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-11 16:57:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-11 16:57:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3940 transitions. [2020-10-11 16:57:06,914 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8164111065064236 [2020-10-11 16:57:06,914 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3940 transitions. [2020-10-11 16:57:06,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3940 transitions. [2020-10-11 16:57:06,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:06,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3940 transitions. [2020-10-11 16:57:06,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 20 states. [2020-10-11 16:57:06,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 20 states. [2020-10-11 16:57:06,921 INFO L81 ComplementDD]: Finished complementDD. Result 20 states. [2020-10-11 16:57:06,921 INFO L185 Difference]: Start difference. First operand has 362 places, 395 transitions, 5647 flow. Second operand 19 states and 3940 transitions. [2020-10-11 16:57:06,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 400 transitions, 6500 flow [2020-10-11 16:57:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 400 transitions, 6191 flow, removed 20 selfloop flow, removed 32 redundant places. [2020-10-11 16:57:07,239 INFO L241 Difference]: Finished difference. Result has 348 places, 350 transitions, 5017 flow [2020-10-11 16:57:07,240 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4813, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5017, PETRI_PLACES=348, PETRI_TRANSITIONS=350} [2020-10-11 16:57:07,240 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 234 predicate places. [2020-10-11 16:57:07,240 INFO L481 AbstractCegarLoop]: Abstraction has has 348 places, 350 transitions, 5017 flow [2020-10-11 16:57:07,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 16:57:07,240 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:07,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:07,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-11 16:57:07,240 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:07,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash 402193726, now seen corresponding path program 1 times [2020-10-11 16:57:07,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:07,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411377470] [2020-10-11 16:57:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:07,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411377470] [2020-10-11 16:57:07,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:07,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 16:57:07,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869053436] [2020-10-11 16:57:07,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 16:57:07,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 16:57:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 16:57:08,590 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 254 [2020-10-11 16:57:08,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 350 transitions, 5017 flow. Second operand 5 states. [2020-10-11 16:57:08,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:08,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 254 [2020-10-11 16:57:08,592 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:10,866 INFO L129 PetriNetUnfolder]: 7304/17521 cut-off events. [2020-10-11 16:57:10,867 INFO L130 PetriNetUnfolder]: For 89837/90187 co-relation queries the response was YES. [2020-10-11 16:57:11,173 INFO L80 FinitePrefix]: Finished finitePrefix Result has 43807 conditions, 17521 events. 7304/17521 cut-off events. For 89837/90187 co-relation queries the response was YES. Maximal size of possible extension queue 1039. Compared 182875 event pairs, 421 based on Foata normal form. 69/13366 useless extension candidates. Maximal degree in co-relation 43677. Up to 3436 conditions per place. [2020-10-11 16:57:11,236 INFO L132 encePairwiseOnDemand]: 247/254 looper letters, 189 selfloop transitions, 10 changer transitions 3/389 dead transitions. [2020-10-11 16:57:11,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 389 transitions, 6238 flow [2020-10-11 16:57:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 16:57:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-11 16:57:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1415 transitions. [2020-10-11 16:57:11,238 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.928477690288714 [2020-10-11 16:57:11,238 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1415 transitions. [2020-10-11 16:57:11,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1415 transitions. [2020-10-11 16:57:11,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:11,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1415 transitions. [2020-10-11 16:57:11,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-11 16:57:11,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-11 16:57:11,240 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-11 16:57:11,240 INFO L185 Difference]: Start difference. First operand has 348 places, 350 transitions, 5017 flow. Second operand 6 states and 1415 transitions. [2020-10-11 16:57:11,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 389 transitions, 6238 flow [2020-10-11 16:57:11,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 389 transitions, 6037 flow, removed 16 selfloop flow, removed 14 redundant places. [2020-10-11 16:57:11,544 INFO L241 Difference]: Finished difference. Result has 341 places, 350 transitions, 4832 flow [2020-10-11 16:57:11,545 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4832, PETRI_PLACES=341, PETRI_TRANSITIONS=350} [2020-10-11 16:57:11,545 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 227 predicate places. [2020-10-11 16:57:11,545 INFO L481 AbstractCegarLoop]: Abstraction has has 341 places, 350 transitions, 4832 flow [2020-10-11 16:57:11,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 16:57:11,545 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:11,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:11,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-11 16:57:11,546 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766192, now seen corresponding path program 2 times [2020-10-11 16:57:11,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:11,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350252856] [2020-10-11 16:57:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:11,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350252856] [2020-10-11 16:57:11,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:11,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 16:57:11,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599544284] [2020-10-11 16:57:11,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 16:57:11,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 16:57:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 16:57:14,908 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 254 [2020-10-11 16:57:14,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 350 transitions, 4832 flow. Second operand 8 states. [2020-10-11 16:57:14,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:14,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 254 [2020-10-11 16:57:14,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:17,884 INFO L129 PetriNetUnfolder]: 7402/18134 cut-off events. [2020-10-11 16:57:17,884 INFO L130 PetriNetUnfolder]: For 87043/87387 co-relation queries the response was YES. [2020-10-11 16:57:18,132 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44029 conditions, 18134 events. 7402/18134 cut-off events. For 87043/87387 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 193153 event pairs, 361 based on Foata normal form. 81/13963 useless extension candidates. Maximal degree in co-relation 43894. Up to 3528 conditions per place. [2020-10-11 16:57:18,173 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 192 selfloop transitions, 55 changer transitions 3/394 dead transitions. [2020-10-11 16:57:18,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 394 transitions, 6147 flow [2020-10-11 16:57:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 16:57:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 16:57:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2208 transitions. [2020-10-11 16:57:18,176 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8692913385826772 [2020-10-11 16:57:18,176 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2208 transitions. [2020-10-11 16:57:18,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2208 transitions. [2020-10-11 16:57:18,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:18,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2208 transitions. [2020-10-11 16:57:18,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 16:57:18,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 16:57:18,178 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 16:57:18,179 INFO L185 Difference]: Start difference. First operand has 341 places, 350 transitions, 4832 flow. Second operand 10 states and 2208 transitions. [2020-10-11 16:57:18,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 394 transitions, 6147 flow [2020-10-11 16:57:18,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 394 transitions, 6118 flow, removed 2 selfloop flow, removed 6 redundant places. [2020-10-11 16:57:18,430 INFO L241 Difference]: Finished difference. Result has 346 places, 349 transitions, 4888 flow [2020-10-11 16:57:18,430 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4757, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4888, PETRI_PLACES=346, PETRI_TRANSITIONS=349} [2020-10-11 16:57:18,431 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 232 predicate places. [2020-10-11 16:57:18,431 INFO L481 AbstractCegarLoop]: Abstraction has has 346 places, 349 transitions, 4888 flow [2020-10-11 16:57:18,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 16:57:18,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:18,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:18,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-11 16:57:18,431 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:18,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1320126557, now seen corresponding path program 1 times [2020-10-11 16:57:18,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:18,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246877335] [2020-10-11 16:57:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:18,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246877335] [2020-10-11 16:57:18,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:18,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 16:57:18,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919960441] [2020-10-11 16:57:18,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 16:57:18,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 16:57:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 16:57:25,462 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 254 [2020-10-11 16:57:25,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 349 transitions, 4888 flow. Second operand 10 states. [2020-10-11 16:57:25,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:25,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 254 [2020-10-11 16:57:25,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:28,141 INFO L129 PetriNetUnfolder]: 6906/16816 cut-off events. [2020-10-11 16:57:28,142 INFO L130 PetriNetUnfolder]: For 84187/84561 co-relation queries the response was YES. [2020-10-11 16:57:28,436 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42500 conditions, 16816 events. 6906/16816 cut-off events. For 84187/84561 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 176030 event pairs, 304 based on Foata normal form. 87/12955 useless extension candidates. Maximal degree in co-relation 42363. Up to 3276 conditions per place. [2020-10-11 16:57:28,487 INFO L132 encePairwiseOnDemand]: 240/254 looper letters, 180 selfloop transitions, 68 changer transitions 3/392 dead transitions. [2020-10-11 16:57:28,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 392 transitions, 6166 flow [2020-10-11 16:57:28,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 16:57:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 16:57:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3050 transitions. [2020-10-11 16:57:28,490 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8577052868391452 [2020-10-11 16:57:28,490 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3050 transitions. [2020-10-11 16:57:28,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3050 transitions. [2020-10-11 16:57:28,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:28,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3050 transitions. [2020-10-11 16:57:28,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 16:57:28,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 16:57:28,495 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 16:57:28,496 INFO L185 Difference]: Start difference. First operand has 346 places, 349 transitions, 4888 flow. Second operand 14 states and 3050 transitions. [2020-10-11 16:57:28,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 392 transitions, 6166 flow [2020-10-11 16:57:28,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 392 transitions, 6052 flow, removed 1 selfloop flow, removed 9 redundant places. [2020-10-11 16:57:28,851 INFO L241 Difference]: Finished difference. Result has 352 places, 348 transitions, 4900 flow [2020-10-11 16:57:28,852 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4733, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4900, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2020-10-11 16:57:28,852 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 238 predicate places. [2020-10-11 16:57:28,852 INFO L481 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 4900 flow [2020-10-11 16:57:28,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 16:57:28,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:28,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:28,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-11 16:57:28,852 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1689790969, now seen corresponding path program 2 times [2020-10-11 16:57:28,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:28,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796908285] [2020-10-11 16:57:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:29,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796908285] [2020-10-11 16:57:29,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:29,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 16:57:29,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696868909] [2020-10-11 16:57:29,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 16:57:29,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 16:57:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 16:57:38,714 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 254 [2020-10-11 16:57:38,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 4900 flow. Second operand 12 states. [2020-10-11 16:57:38,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:38,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 254 [2020-10-11 16:57:38,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:41,420 INFO L129 PetriNetUnfolder]: 6789/16785 cut-off events. [2020-10-11 16:57:41,421 INFO L130 PetriNetUnfolder]: For 85095/85461 co-relation queries the response was YES. [2020-10-11 16:57:41,738 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42257 conditions, 16785 events. 6789/16785 cut-off events. For 85095/85461 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 177370 event pairs, 255 based on Foata normal form. 80/13010 useless extension candidates. Maximal degree in co-relation 42118. Up to 3252 conditions per place. [2020-10-11 16:57:41,778 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 169 selfloop transitions, 80 changer transitions 3/389 dead transitions. [2020-10-11 16:57:41,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 389 transitions, 6071 flow [2020-10-11 16:57:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 16:57:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 16:57:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3453 transitions. [2020-10-11 16:57:41,784 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8496555118110236 [2020-10-11 16:57:41,785 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3453 transitions. [2020-10-11 16:57:41,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3453 transitions. [2020-10-11 16:57:41,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:41,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3453 transitions. [2020-10-11 16:57:41,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 16:57:41,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 16:57:41,790 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 16:57:41,791 INFO L185 Difference]: Start difference. First operand has 352 places, 348 transitions, 4900 flow. Second operand 16 states and 3453 transitions. [2020-10-11 16:57:41,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 389 transitions, 6071 flow [2020-10-11 16:57:42,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 389 transitions, 5929 flow, removed 2 selfloop flow, removed 13 redundant places. [2020-10-11 16:57:42,075 INFO L241 Difference]: Finished difference. Result has 356 places, 347 transitions, 4911 flow [2020-10-11 16:57:42,075 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4710, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4911, PETRI_PLACES=356, PETRI_TRANSITIONS=347} [2020-10-11 16:57:42,076 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 242 predicate places. [2020-10-11 16:57:42,076 INFO L481 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 4911 flow [2020-10-11 16:57:42,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 16:57:42,076 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:42,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:42,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-11 16:57:42,076 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash 943654439, now seen corresponding path program 3 times [2020-10-11 16:57:42,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:42,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515212613] [2020-10-11 16:57:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:42,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515212613] [2020-10-11 16:57:42,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:42,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 16:57:42,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591129580] [2020-10-11 16:57:42,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 16:57:42,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:42,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 16:57:42,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-11 16:57:53,134 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 254 [2020-10-11 16:57:53,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 347 transitions, 4911 flow. Second operand 14 states. [2020-10-11 16:57:53,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:57:53,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 254 [2020-10-11 16:57:53,136 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:57:56,109 INFO L129 PetriNetUnfolder]: 6900/17180 cut-off events. [2020-10-11 16:57:56,109 INFO L130 PetriNetUnfolder]: For 85604/85968 co-relation queries the response was YES. [2020-10-11 16:57:56,423 INFO L80 FinitePrefix]: Finished finitePrefix Result has 42408 conditions, 17180 events. 6900/17180 cut-off events. For 85604/85968 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 183214 event pairs, 212 based on Foata normal form. 88/13316 useless extension candidates. Maximal degree in co-relation 42267. Up to 3364 conditions per place. [2020-10-11 16:57:56,461 INFO L132 encePairwiseOnDemand]: 237/254 looper letters, 158 selfloop transitions, 93 changer transitions 4/388 dead transitions. [2020-10-11 16:57:56,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 388 transitions, 6084 flow [2020-10-11 16:57:56,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:57:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:57:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3848 transitions. [2020-10-11 16:57:56,464 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8416447944007 [2020-10-11 16:57:56,464 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3848 transitions. [2020-10-11 16:57:56,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3848 transitions. [2020-10-11 16:57:56,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:57:56,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3848 transitions. [2020-10-11 16:57:56,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:57:56,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:57:56,469 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:57:56,469 INFO L185 Difference]: Start difference. First operand has 356 places, 347 transitions, 4911 flow. Second operand 18 states and 3848 transitions. [2020-10-11 16:57:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 388 transitions, 6084 flow [2020-10-11 16:57:56,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 388 transitions, 5892 flow, removed 4 selfloop flow, removed 16 redundant places. [2020-10-11 16:57:56,742 INFO L241 Difference]: Finished difference. Result has 359 places, 346 transitions, 4919 flow [2020-10-11 16:57:56,742 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4682, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4919, PETRI_PLACES=359, PETRI_TRANSITIONS=346} [2020-10-11 16:57:56,743 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 245 predicate places. [2020-10-11 16:57:56,743 INFO L481 AbstractCegarLoop]: Abstraction has has 359 places, 346 transitions, 4919 flow [2020-10-11 16:57:56,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 16:57:56,743 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:57:56,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:57:56,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-11 16:57:56,743 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:57:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:57:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash -515393793, now seen corresponding path program 4 times [2020-10-11 16:57:56,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:57:56,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082500329] [2020-10-11 16:57:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:57:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:57:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:57:57,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082500329] [2020-10-11 16:57:57,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:57:57,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 16:57:57,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634612572] [2020-10-11 16:57:57,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 16:57:57,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:57:57,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 16:57:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-10-11 16:58:13,816 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:58:13,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 346 transitions, 4919 flow. Second operand 16 states. [2020-10-11 16:58:13,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:58:13,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:58:13,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:58:17,142 INFO L129 PetriNetUnfolder]: 7163/17706 cut-off events. [2020-10-11 16:58:17,142 INFO L130 PetriNetUnfolder]: For 90680/91055 co-relation queries the response was YES. [2020-10-11 16:58:17,469 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44722 conditions, 17706 events. 7163/17706 cut-off events. For 90680/91055 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 188741 event pairs, 167 based on Foata normal form. 80/13692 useless extension candidates. Maximal degree in co-relation 44578. Up to 3476 conditions per place. [2020-10-11 16:58:17,508 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 183 selfloop transitions, 114 changer transitions 4/431 dead transitions. [2020-10-11 16:58:17,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 431 transitions, 6831 flow [2020-10-11 16:58:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-11 16:58:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-11 16:58:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4253 transitions. [2020-10-11 16:58:17,511 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8372047244094488 [2020-10-11 16:58:17,512 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4253 transitions. [2020-10-11 16:58:17,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4253 transitions. [2020-10-11 16:58:17,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:58:17,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4253 transitions. [2020-10-11 16:58:17,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 21 states. [2020-10-11 16:58:17,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 21 states. [2020-10-11 16:58:17,517 INFO L81 ComplementDD]: Finished complementDD. Result 21 states. [2020-10-11 16:58:17,517 INFO L185 Difference]: Start difference. First operand has 359 places, 346 transitions, 4919 flow. Second operand 20 states and 4253 transitions. [2020-10-11 16:58:17,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 431 transitions, 6831 flow [2020-10-11 16:58:17,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 431 transitions, 6626 flow, removed 10 selfloop flow, removed 16 redundant places. [2020-10-11 16:58:17,820 INFO L241 Difference]: Finished difference. Result has 367 places, 372 transitions, 5587 flow [2020-10-11 16:58:17,821 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=4729, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5587, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2020-10-11 16:58:17,821 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 253 predicate places. [2020-10-11 16:58:17,821 INFO L481 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 5587 flow [2020-10-11 16:58:17,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 16:58:17,821 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:58:17,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:58:17,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-11 16:58:17,822 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:58:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:58:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1369178225, now seen corresponding path program 5 times [2020-10-11 16:58:17,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:58:17,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939407944] [2020-10-11 16:58:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:58:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:58:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:58:18,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939407944] [2020-10-11 16:58:18,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:58:18,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-11 16:58:18,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396243616] [2020-10-11 16:58:18,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-11 16:58:18,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:58:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-11 16:58:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-10-11 16:58:32,642 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:58:32,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 5587 flow. Second operand 16 states. [2020-10-11 16:58:32,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:58:32,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:58:32,644 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:58:35,530 INFO L129 PetriNetUnfolder]: 7080/17554 cut-off events. [2020-10-11 16:58:35,531 INFO L130 PetriNetUnfolder]: For 107966/108374 co-relation queries the response was YES. [2020-10-11 16:58:35,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46509 conditions, 17554 events. 7080/17554 cut-off events. For 107966/108374 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 187378 event pairs, 236 based on Foata normal form. 81/13545 useless extension candidates. Maximal degree in co-relation 46361. Up to 3452 conditions per place. [2020-10-11 16:58:35,909 INFO L132 encePairwiseOnDemand]: 236/254 looper letters, 179 selfloop transitions, 87 changer transitions 1/397 dead transitions. [2020-10-11 16:58:35,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 397 transitions, 6513 flow [2020-10-11 16:58:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 16:58:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 16:58:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2020-10-11 16:58:35,912 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8391883706844336 [2020-10-11 16:58:35,912 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2771 transitions. [2020-10-11 16:58:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2771 transitions. [2020-10-11 16:58:35,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:58:35,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2771 transitions. [2020-10-11 16:58:35,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 16:58:35,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 16:58:35,915 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 16:58:35,915 INFO L185 Difference]: Start difference. First operand has 367 places, 372 transitions, 5587 flow. Second operand 13 states and 2771 transitions. [2020-10-11 16:58:35,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 397 transitions, 6513 flow [2020-10-11 16:58:36,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 397 transitions, 6339 flow, removed 58 selfloop flow, removed 10 redundant places. [2020-10-11 16:58:36,205 INFO L241 Difference]: Finished difference. Result has 372 places, 378 transitions, 5822 flow [2020-10-11 16:58:36,205 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=5444, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5822, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2020-10-11 16:58:36,205 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 258 predicate places. [2020-10-11 16:58:36,206 INFO L481 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 5822 flow [2020-10-11 16:58:36,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-11 16:58:36,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:58:36,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:58:36,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-11 16:58:36,206 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:58:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:58:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash -940286263, now seen corresponding path program 6 times [2020-10-11 16:58:36,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:58:36,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406863313] [2020-10-11 16:58:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:58:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:58:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:58:36,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406863313] [2020-10-11 16:58:36,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:58:36,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-11 16:58:36,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149773207] [2020-10-11 16:58:36,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-11 16:58:36,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:58:36,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-11 16:58:36,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2020-10-11 16:59:06,448 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 254 [2020-10-11 16:59:06,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 5822 flow. Second operand 20 states. [2020-10-11 16:59:06,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:59:06,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 254 [2020-10-11 16:59:06,451 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:59:10,814 INFO L129 PetriNetUnfolder]: 9178/22348 cut-off events. [2020-10-11 16:59:10,815 INFO L130 PetriNetUnfolder]: For 117079/117434 co-relation queries the response was YES. [2020-10-11 16:59:11,245 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54601 conditions, 22348 events. 9178/22348 cut-off events. For 117079/117434 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 245942 event pairs, 262 based on Foata normal form. 85/16894 useless extension candidates. Maximal degree in co-relation 54395. Up to 4640 conditions per place. [2020-10-11 16:59:11,303 INFO L132 encePairwiseOnDemand]: 234/254 looper letters, 212 selfloop transitions, 108 changer transitions 0/442 dead transitions. [2020-10-11 16:59:11,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 442 transitions, 7524 flow [2020-10-11 16:59:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 16:59:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 16:59:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3553 transitions. [2020-10-11 16:59:11,306 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8228346456692913 [2020-10-11 16:59:11,306 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3553 transitions. [2020-10-11 16:59:11,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3553 transitions. [2020-10-11 16:59:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:59:11,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3553 transitions. [2020-10-11 16:59:11,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 16:59:11,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 16:59:11,310 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 16:59:11,310 INFO L185 Difference]: Start difference. First operand has 372 places, 378 transitions, 5822 flow. Second operand 17 states and 3553 transitions. [2020-10-11 16:59:11,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 442 transitions, 7524 flow [2020-10-11 16:59:11,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 442 transitions, 7342 flow, removed 19 selfloop flow, removed 8 redundant places. [2020-10-11 16:59:11,759 INFO L241 Difference]: Finished difference. Result has 384 places, 395 transitions, 6414 flow [2020-10-11 16:59:11,759 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6414, PETRI_PLACES=384, PETRI_TRANSITIONS=395} [2020-10-11 16:59:11,760 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 270 predicate places. [2020-10-11 16:59:11,760 INFO L481 AbstractCegarLoop]: Abstraction has has 384 places, 395 transitions, 6414 flow [2020-10-11 16:59:11,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-11 16:59:11,760 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:59:11,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:59:11,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-11 16:59:11,760 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:59:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:59:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash -465961824, now seen corresponding path program 1 times [2020-10-11 16:59:11,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:59:11,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158568418] [2020-10-11 16:59:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:59:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:59:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:59:12,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158568418] [2020-10-11 16:59:12,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:59:12,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-11 16:59:12,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301379486] [2020-10-11 16:59:12,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-11 16:59:12,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:59:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-11 16:59:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-11 16:59:30,200 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 254 [2020-10-11 16:59:30,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 395 transitions, 6414 flow. Second operand 15 states. [2020-10-11 16:59:30,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 16:59:30,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 254 [2020-10-11 16:59:30,202 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 16:59:34,187 INFO L129 PetriNetUnfolder]: 9041/22086 cut-off events. [2020-10-11 16:59:34,187 INFO L130 PetriNetUnfolder]: For 117944/118284 co-relation queries the response was YES. [2020-10-11 16:59:34,638 INFO L80 FinitePrefix]: Finished finitePrefix Result has 53683 conditions, 22086 events. 9041/22086 cut-off events. For 117944/118284 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 243040 event pairs, 191 based on Foata normal form. 73/16729 useless extension candidates. Maximal degree in co-relation 53476. Up to 4584 conditions per place. [2020-10-11 16:59:34,688 INFO L132 encePairwiseOnDemand]: 239/254 looper letters, 189 selfloop transitions, 112 changer transitions 5/436 dead transitions. [2020-10-11 16:59:34,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 436 transitions, 7819 flow [2020-10-11 16:59:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 16:59:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 16:59:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3805 transitions. [2020-10-11 16:59:34,692 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8322397200349956 [2020-10-11 16:59:34,693 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3805 transitions. [2020-10-11 16:59:34,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3805 transitions. [2020-10-11 16:59:34,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 16:59:34,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3805 transitions. [2020-10-11 16:59:34,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 16:59:34,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 16:59:34,696 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 16:59:34,696 INFO L185 Difference]: Start difference. First operand has 384 places, 395 transitions, 6414 flow. Second operand 18 states and 3805 transitions. [2020-10-11 16:59:34,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 436 transitions, 7819 flow [2020-10-11 16:59:35,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 436 transitions, 7675 flow, removed 7 selfloop flow, removed 13 redundant places. [2020-10-11 16:59:35,129 INFO L241 Difference]: Finished difference. Result has 390 places, 390 transitions, 6478 flow [2020-10-11 16:59:35,130 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=6195, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6478, PETRI_PLACES=390, PETRI_TRANSITIONS=390} [2020-10-11 16:59:35,130 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 276 predicate places. [2020-10-11 16:59:35,130 INFO L481 AbstractCegarLoop]: Abstraction has has 390 places, 390 transitions, 6478 flow [2020-10-11 16:59:35,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-11 16:59:35,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 16:59:35,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 16:59:35,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-11 16:59:35,131 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 16:59:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 16:59:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1402928928, now seen corresponding path program 2 times [2020-10-11 16:59:35,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 16:59:35,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151892575] [2020-10-11 16:59:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 16:59:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 16:59:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 16:59:35,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151892575] [2020-10-11 16:59:35,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 16:59:35,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-11 16:59:35,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651957638] [2020-10-11 16:59:35,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-11 16:59:35,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 16:59:35,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-11 16:59:35,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-11 17:00:00,484 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 254 [2020-10-11 17:00:00,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 390 transitions, 6478 flow. Second operand 17 states. [2020-10-11 17:00:00,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:00:00,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 254 [2020-10-11 17:00:00,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:00:06,007 INFO L129 PetriNetUnfolder]: 9368/22747 cut-off events. [2020-10-11 17:00:06,008 INFO L130 PetriNetUnfolder]: For 119116/119462 co-relation queries the response was YES. [2020-10-11 17:00:06,356 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54019 conditions, 22747 events. 9368/22747 cut-off events. For 119116/119462 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 250329 event pairs, 156 based on Foata normal form. 82/17145 useless extension candidates. Maximal degree in co-relation 53800. Up to 4792 conditions per place. [2020-10-11 17:00:06,399 INFO L132 encePairwiseOnDemand]: 234/254 looper letters, 166 selfloop transitions, 152 changer transitions 7/451 dead transitions. [2020-10-11 17:00:06,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 451 transitions, 8337 flow [2020-10-11 17:00:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-11 17:00:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-11 17:00:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4603 transitions. [2020-10-11 17:00:06,403 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8237294201861131 [2020-10-11 17:00:06,403 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4603 transitions. [2020-10-11 17:00:06,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4603 transitions. [2020-10-11 17:00:06,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:00:06,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4603 transitions. [2020-10-11 17:00:06,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-11 17:00:06,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-11 17:00:06,408 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-11 17:00:06,408 INFO L185 Difference]: Start difference. First operand has 390 places, 390 transitions, 6478 flow. Second operand 22 states and 4603 transitions. [2020-10-11 17:00:06,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 451 transitions, 8337 flow [2020-10-11 17:00:06,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 451 transitions, 8125 flow, removed 0 selfloop flow, removed 16 redundant places. [2020-10-11 17:00:06,828 INFO L241 Difference]: Finished difference. Result has 400 places, 408 transitions, 7183 flow [2020-10-11 17:00:06,828 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=6272, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7183, PETRI_PLACES=400, PETRI_TRANSITIONS=408} [2020-10-11 17:00:06,828 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 286 predicate places. [2020-10-11 17:00:06,828 INFO L481 AbstractCegarLoop]: Abstraction has has 400 places, 408 transitions, 7183 flow [2020-10-11 17:00:06,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-11 17:00:06,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:00:06,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:00:06,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-11 17:00:06,829 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:00:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:00:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2126192212, now seen corresponding path program 3 times [2020-10-11 17:00:06,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:00:06,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936556355] [2020-10-11 17:00:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:00:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 17:00:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 17:00:07,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936556355] [2020-10-11 17:00:07,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 17:00:07,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-11 17:00:07,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308022983] [2020-10-11 17:00:07,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 17:00:07,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 17:00:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 17:00:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-10-11 17:00:38,693 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 254 [2020-10-11 17:00:38,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 408 transitions, 7183 flow. Second operand 19 states. [2020-10-11 17:00:38,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:00:38,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 254 [2020-10-11 17:00:38,697 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:00:44,702 INFO L129 PetriNetUnfolder]: 9158/22262 cut-off events. [2020-10-11 17:00:44,702 INFO L130 PetriNetUnfolder]: For 131007/131120 co-relation queries the response was YES. [2020-10-11 17:00:45,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54260 conditions, 22262 events. 9158/22262 cut-off events. For 131007/131120 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 243789 event pairs, 42 based on Foata normal form. 69/16798 useless extension candidates. Maximal degree in co-relation 54025. Up to 4668 conditions per place. [2020-10-11 17:00:45,262 INFO L132 encePairwiseOnDemand]: 233/254 looper letters, 201 selfloop transitions, 140 changer transitions 3/466 dead transitions. [2020-10-11 17:00:45,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 466 transitions, 8701 flow [2020-10-11 17:00:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-11 17:00:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-11 17:00:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 7005 transitions. [2020-10-11 17:00:45,267 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8111394163964799 [2020-10-11 17:00:45,267 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 7005 transitions. [2020-10-11 17:00:45,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 7005 transitions. [2020-10-11 17:00:45,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:00:45,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 7005 transitions. [2020-10-11 17:00:45,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 35 states. [2020-10-11 17:00:45,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 35 states. [2020-10-11 17:00:45,276 INFO L81 ComplementDD]: Finished complementDD. Result 35 states. [2020-10-11 17:00:45,276 INFO L185 Difference]: Start difference. First operand has 400 places, 408 transitions, 7183 flow. Second operand 34 states and 7005 transitions. [2020-10-11 17:00:45,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 466 transitions, 8701 flow [2020-10-11 17:00:45,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 466 transitions, 8306 flow, removed 82 selfloop flow, removed 19 redundant places. [2020-10-11 17:00:45,745 INFO L241 Difference]: Finished difference. Result has 416 places, 420 transitions, 7203 flow [2020-10-11 17:00:45,746 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=6736, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7203, PETRI_PLACES=416, PETRI_TRANSITIONS=420} [2020-10-11 17:00:45,746 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 302 predicate places. [2020-10-11 17:00:45,746 INFO L481 AbstractCegarLoop]: Abstraction has has 416 places, 420 transitions, 7203 flow [2020-10-11 17:00:45,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 17:00:45,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:00:45,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:00:45,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-11 17:00:45,747 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:00:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:00:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash 938787300, now seen corresponding path program 4 times [2020-10-11 17:00:45,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:00:45,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123475937] [2020-10-11 17:00:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:00:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 17:00:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 17:00:46,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123475937] [2020-10-11 17:00:46,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 17:00:46,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-11 17:00:46,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340116187] [2020-10-11 17:00:46,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-11 17:00:46,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 17:00:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-11 17:00:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-10-11 17:01:23,004 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 254 [2020-10-11 17:01:23,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 420 transitions, 7203 flow. Second operand 20 states. [2020-10-11 17:01:23,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:01:23,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 254 [2020-10-11 17:01:23,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:01:23,893 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2020-10-11 17:01:24,096 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-10-11 17:01:24,256 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2020-10-11 17:01:24,422 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-10-11 17:01:24,641 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2020-10-11 17:01:27,411 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-10-11 17:01:29,054 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2020-10-11 17:01:29,965 INFO L129 PetriNetUnfolder]: 12273/29889 cut-off events. [2020-10-11 17:01:29,966 INFO L130 PetriNetUnfolder]: For 158080/158206 co-relation queries the response was YES. [2020-10-11 17:01:34,890 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69766 conditions, 29889 events. 12273/29889 cut-off events. For 158080/158206 co-relation queries the response was YES. Maximal size of possible extension queue 1906. Compared 344457 event pairs, 111 based on Foata normal form. 82/22231 useless extension candidates. Maximal degree in co-relation 69534. Up to 6512 conditions per place. [2020-10-11 17:01:34,969 INFO L132 encePairwiseOnDemand]: 230/254 looper letters, 256 selfloop transitions, 180 changer transitions 0/558 dead transitions. [2020-10-11 17:01:34,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 558 transitions, 10387 flow [2020-10-11 17:01:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-11 17:01:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-11 17:01:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4792 transitions. [2020-10-11 17:01:34,975 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8202670318384115 [2020-10-11 17:01:34,975 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4792 transitions. [2020-10-11 17:01:34,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4792 transitions. [2020-10-11 17:01:34,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:01:34,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4792 transitions. [2020-10-11 17:01:34,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-11 17:01:34,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-11 17:01:34,980 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-11 17:01:34,980 INFO L185 Difference]: Start difference. First operand has 416 places, 420 transitions, 7203 flow. Second operand 23 states and 4792 transitions. [2020-10-11 17:01:34,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 558 transitions, 10387 flow [2020-10-11 17:01:35,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 558 transitions, 10117 flow, removed 37 selfloop flow, removed 22 redundant places. [2020-10-11 17:01:35,525 INFO L241 Difference]: Finished difference. Result has 424 places, 476 transitions, 8833 flow [2020-10-11 17:01:35,525 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=7004, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8833, PETRI_PLACES=424, PETRI_TRANSITIONS=476} [2020-10-11 17:01:35,526 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 310 predicate places. [2020-10-11 17:01:35,526 INFO L481 AbstractCegarLoop]: Abstraction has has 424 places, 476 transitions, 8833 flow [2020-10-11 17:01:35,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-11 17:01:35,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:01:35,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:01:35,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-11 17:01:35,527 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:01:35,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:01:35,527 INFO L82 PathProgramCache]: Analyzing trace with hash -728977398, now seen corresponding path program 5 times [2020-10-11 17:01:35,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:01:35,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048560607] [2020-10-11 17:01:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:01:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 17:01:35,870 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-10-11 17:01:36,373 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2020-10-11 17:01:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 17:01:36,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048560607] [2020-10-11 17:01:36,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 17:01:36,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-11 17:01:36,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701682315] [2020-10-11 17:01:36,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-11 17:01:36,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 17:01:36,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-11 17:01:36,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-10-11 17:02:07,817 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 254 [2020-10-11 17:02:07,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 476 transitions, 8833 flow. Second operand 19 states. [2020-10-11 17:02:07,819 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:02:07,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 254 [2020-10-11 17:02:07,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:02:14,542 INFO L129 PetriNetUnfolder]: 12011/29221 cut-off events. [2020-10-11 17:02:14,542 INFO L130 PetriNetUnfolder]: For 169570/169731 co-relation queries the response was YES. [2020-10-11 17:02:15,162 INFO L80 FinitePrefix]: Finished finitePrefix Result has 70383 conditions, 29221 events. 12011/29221 cut-off events. For 169570/169731 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 334777 event pairs, 44 based on Foata normal form. 86/21716 useless extension candidates. Maximal degree in co-relation 70148. Up to 6448 conditions per place. [2020-10-11 17:02:15,235 INFO L132 encePairwiseOnDemand]: 235/254 looper letters, 248 selfloop transitions, 104 changer transitions 2/464 dead transitions. [2020-10-11 17:02:15,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 464 transitions, 9791 flow [2020-10-11 17:02:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-11 17:02:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-11 17:02:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4738 transitions. [2020-10-11 17:02:15,239 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8110236220472441 [2020-10-11 17:02:15,239 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4738 transitions. [2020-10-11 17:02:15,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4738 transitions. [2020-10-11 17:02:15,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:02:15,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4738 transitions. [2020-10-11 17:02:15,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-11 17:02:15,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-11 17:02:15,245 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-11 17:02:15,245 INFO L185 Difference]: Start difference. First operand has 424 places, 476 transitions, 8833 flow. Second operand 23 states and 4738 transitions. [2020-10-11 17:02:15,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 464 transitions, 9791 flow [2020-10-11 17:02:16,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 464 transitions, 9147 flow, removed 201 selfloop flow, removed 27 redundant places. [2020-10-11 17:02:16,127 INFO L241 Difference]: Finished difference. Result has 400 places, 426 transitions, 8027 flow [2020-10-11 17:02:16,128 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=7763, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8027, PETRI_PLACES=400, PETRI_TRANSITIONS=426} [2020-10-11 17:02:16,128 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 286 predicate places. [2020-10-11 17:02:16,128 INFO L481 AbstractCegarLoop]: Abstraction has has 400 places, 426 transitions, 8027 flow [2020-10-11 17:02:16,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-11 17:02:16,128 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:02:16,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:02:16,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-10-11 17:02:16,129 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:02:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:02:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 413771781, now seen corresponding path program 1 times [2020-10-11 17:02:16,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:02:16,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270685649] [2020-10-11 17:02:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:02:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 17:02:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 17:02:16,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270685649] [2020-10-11 17:02:16,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 17:02:16,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 17:02:16,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506885171] [2020-10-11 17:02:16,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 17:02:16,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 17:02:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 17:02:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 17:02:24,061 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 254 [2020-10-11 17:02:24,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 426 transitions, 8027 flow. Second operand 9 states. [2020-10-11 17:02:24,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:02:24,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 254 [2020-10-11 17:02:24,062 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:02:28,793 INFO L129 PetriNetUnfolder]: 11921/28840 cut-off events. [2020-10-11 17:02:28,793 INFO L130 PetriNetUnfolder]: For 136947/137614 co-relation queries the response was YES. [2020-10-11 17:02:29,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 65280 conditions, 28840 events. 11921/28840 cut-off events. For 136947/137614 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 328747 event pairs, 66 based on Foata normal form. 237/21454 useless extension candidates. Maximal degree in co-relation 65057. Up to 6344 conditions per place. [2020-10-11 17:02:29,342 INFO L132 encePairwiseOnDemand]: 243/254 looper letters, 93 selfloop transitions, 99 changer transitions 12/439 dead transitions. [2020-10-11 17:02:29,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 439 transitions, 8693 flow [2020-10-11 17:02:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 17:02:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 17:02:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1962 transitions. [2020-10-11 17:02:29,345 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8582677165354331 [2020-10-11 17:02:29,345 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1962 transitions. [2020-10-11 17:02:29,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1962 transitions. [2020-10-11 17:02:29,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:02:29,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1962 transitions. [2020-10-11 17:02:29,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 17:02:29,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 17:02:29,349 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 17:02:29,349 INFO L185 Difference]: Start difference. First operand has 400 places, 426 transitions, 8027 flow. Second operand 9 states and 1962 transitions. [2020-10-11 17:02:29,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 439 transitions, 8693 flow [2020-10-11 17:02:29,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 439 transitions, 8516 flow, removed 0 selfloop flow, removed 21 redundant places. [2020-10-11 17:02:29,716 INFO L241 Difference]: Finished difference. Result has 387 places, 424 transitions, 8042 flow [2020-10-11 17:02:29,717 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=7844, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8042, PETRI_PLACES=387, PETRI_TRANSITIONS=424} [2020-10-11 17:02:29,717 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 273 predicate places. [2020-10-11 17:02:29,717 INFO L481 AbstractCegarLoop]: Abstraction has has 387 places, 424 transitions, 8042 flow [2020-10-11 17:02:29,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 17:02:29,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:02:29,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:02:29,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-10-11 17:02:29,718 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:02:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:02:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash 258970316, now seen corresponding path program 1 times [2020-10-11 17:02:29,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:02:29,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795726905] [2020-10-11 17:02:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:02:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 17:02:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 17:02:30,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795726905] [2020-10-11 17:02:30,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 17:02:30,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 17:02:30,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117834748] [2020-10-11 17:02:30,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 17:02:30,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 17:02:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 17:02:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-11 17:02:45,064 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 254 [2020-10-11 17:02:45,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 424 transitions, 8042 flow. Second operand 12 states. [2020-10-11 17:02:45,065 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 17:02:45,065 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 254 [2020-10-11 17:02:45,065 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 17:02:50,789 INFO L129 PetriNetUnfolder]: 13130/31169 cut-off events. [2020-10-11 17:02:50,789 INFO L130 PetriNetUnfolder]: For 228703/229374 co-relation queries the response was YES. [2020-10-11 17:02:51,307 INFO L80 FinitePrefix]: Finished finitePrefix Result has 87899 conditions, 31169 events. 13130/31169 cut-off events. For 228703/229374 co-relation queries the response was YES. Maximal size of possible extension queue 2009. Compared 353510 event pairs, 266 based on Foata normal form. 841/24177 useless extension candidates. Maximal degree in co-relation 87686. Up to 6344 conditions per place. [2020-10-11 17:02:51,364 INFO L132 encePairwiseOnDemand]: 242/254 looper letters, 99 selfloop transitions, 101 changer transitions 18/440 dead transitions. [2020-10-11 17:02:51,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 440 transitions, 8772 flow [2020-10-11 17:02:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-11 17:02:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-11 17:02:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2156 transitions. [2020-10-11 17:02:51,366 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8488188976377953 [2020-10-11 17:02:51,367 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2156 transitions. [2020-10-11 17:02:51,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2156 transitions. [2020-10-11 17:02:51,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 17:02:51,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2156 transitions. [2020-10-11 17:02:51,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-11 17:02:51,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-11 17:02:51,370 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-11 17:02:51,370 INFO L185 Difference]: Start difference. First operand has 387 places, 424 transitions, 8042 flow. Second operand 10 states and 2156 transitions. [2020-10-11 17:02:51,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 440 transitions, 8772 flow [2020-10-11 17:02:51,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 440 transitions, 8574 flow, removed 0 selfloop flow, removed 8 redundant places. [2020-10-11 17:02:51,716 INFO L241 Difference]: Finished difference. Result has 388 places, 422 transitions, 8040 flow [2020-10-11 17:02:51,716 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=7838, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8040, PETRI_PLACES=388, PETRI_TRANSITIONS=422} [2020-10-11 17:02:51,717 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 274 predicate places. [2020-10-11 17:02:51,717 INFO L481 AbstractCegarLoop]: Abstraction has has 388 places, 422 transitions, 8040 flow [2020-10-11 17:02:51,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 17:02:51,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 17:02:51,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 17:02:51,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-11 17:02:51,718 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-11 17:02:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 17:02:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 350323666, now seen corresponding path program 1 times [2020-10-11 17:02:51,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 17:02:51,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304628522] [2020-10-11 17:02:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 17:02:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 17:02:51,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 17:02:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 17:02:51,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 17:02:51,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 17:02:51,803 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 17:02:51,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-11 17:02:51,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:02:51 BasicIcfg [2020-10-11 17:02:51,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 17:02:51,986 INFO L168 Benchmark]: Toolchain (without parser) took 682315.01 ms. Allocated memory was 251.7 MB in the beginning and 5.3 GB in the end (delta: 5.1 GB). Free memory was 207.3 MB in the beginning and 3.1 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,987 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.50 ms. Allocated memory was 251.7 MB in the beginning and 317.2 MB in the end (delta: 65.5 MB). Free memory was 207.3 MB in the beginning and 234.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 49.2 MB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.92 ms. Allocated memory is still 317.2 MB. Free memory was 234.0 MB in the beginning and 231.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,988 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 ms. Allocated memory is still 317.2 MB. Free memory was 231.3 MB in the beginning and 229.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,988 INFO L168 Benchmark]: RCFGBuilder took 476.98 ms. Allocated memory is still 317.2 MB. Free memory was 229.6 MB in the beginning and 202.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,988 INFO L168 Benchmark]: TraceAbstraction took 680909.69 ms. Allocated memory was 317.2 MB in the beginning and 5.3 GB in the end (delta: 5.0 GB). Free memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 14.2 GB. [2020-10-11 17:02:51,992 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.19 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 836.50 ms. Allocated memory was 251.7 MB in the beginning and 317.2 MB in the end (delta: 65.5 MB). Free memory was 207.3 MB in the beginning and 234.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 49.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 53.92 ms. Allocated memory is still 317.2 MB. Free memory was 234.0 MB in the beginning and 231.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 28.08 ms. Allocated memory is still 317.2 MB. Free memory was 231.3 MB in the beginning and 229.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 476.98 ms. Allocated memory is still 317.2 MB. Free memory was 229.6 MB in the beginning and 202.4 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 680909.69 ms. Allocated memory was 317.2 MB in the beginning and 5.3 GB in the end (delta: 5.0 GB). Free memory was 202.4 MB in the beginning and 3.1 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; VAL [v={0:0}] [L1122] 0 pthread_t t; VAL [v={0:0}] [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={8:0}, v={0:0}] [L1124] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={8:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1093] 2 return 0; VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1097] 3 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1097] 6 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1098] 6 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1097] 5 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1102] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1103] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1098] 3 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1098] 5 return 0; VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={8:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t2={9:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t3={10:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t4={11:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t5={6:0}, v={-1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1125] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1088] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 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: UNSAFE, OverallTime: 680.4s, OverallIterations: 48, TraceHistogramMax: 1, AutomataDifference: 666.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 9579 SDtfs, 24538 SDslu, 82557 SDs, 0 SdLazy, 92894 SolverSat, 2907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1056 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 956 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3727 ImplicationChecksByTransitivity, 27.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8833occurred in iteration=44, 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.4s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 2434 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2299 ConstructedInterpolants, 0 QuantifiedInterpolants, 1062354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...