/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:49:52,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:49:52,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:49:52,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:49:52,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:49:52,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:49:52,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:49:52,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:49:52,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:49:52,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:49:52,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:49:52,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:49:52,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:49:52,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:49:52,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:49:52,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:49:52,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:49:52,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:49:52,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:49:52,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:49:52,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:49:52,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:49:52,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:49:52,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:49:52,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:49:52,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:49:52,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:49:52,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:49:52,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:49:52,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:49:52,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:49:52,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:49:52,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:49:52,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:49:52,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:49:52,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:49:52,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:49:52,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:49:52,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:49:52,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:49:52,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:49:52,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 00:49:52,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:49:52,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:49:52,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:49:52,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:49:52,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:49:52,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:49:52,535 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:49:52,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:49:52,535 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:49:52,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:49:52,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:49:52,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:49:52,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:49:52,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:49:52,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:49:52,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:49:52,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:49:52,708 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:49:52,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-01-19 00:49:52,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95095ce85/1cdf2937033f41739e66ee10db800140/FLAG3b5a099d5 [2022-01-19 00:49:53,111 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:49:53,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-01-19 00:49:53,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95095ce85/1cdf2937033f41739e66ee10db800140/FLAG3b5a099d5 [2022-01-19 00:49:53,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95095ce85/1cdf2937033f41739e66ee10db800140 [2022-01-19 00:49:53,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:49:53,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:49:53,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:49:53,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:49:53,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:49:53,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4704e1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53, skipping insertion in model container [2022-01-19 00:49:53,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:49:53,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:49:53,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2575,2588] [2022-01-19 00:49:53,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:49:53,293 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:49:53,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2575,2588] [2022-01-19 00:49:53,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:49:53,315 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:49:53,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53 WrapperNode [2022-01-19 00:49:53,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:49:53,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:49:53,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:49:53,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:49:53,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,341 INFO L137 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 179 [2022-01-19 00:49:53,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:49:53,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:49:53,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:49:53,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:49:53,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:49:53,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:49:53,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:49:53,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:49:53,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (1/1) ... [2022-01-19 00:49:53,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:49:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:49:53,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:49:53,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:49:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:49:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:49:53,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:49:53,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:49:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:49:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:49:53,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:49:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:49:53,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:49:53,416 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:49:53,475 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:49:53,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:49:53,679 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:49:53,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:49:53,686 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 00:49:53,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:49:53 BoogieIcfgContainer [2022-01-19 00:49:53,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:49:53,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:49:53,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:49:53,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:49:53,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:49:53" (1/3) ... [2022-01-19 00:49:53,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a26680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:49:53, skipping insertion in model container [2022-01-19 00:49:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:49:53" (2/3) ... [2022-01-19 00:49:53,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a26680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:49:53, skipping insertion in model container [2022-01-19 00:49:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:49:53" (3/3) ... [2022-01-19 00:49:53,693 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2022-01-19 00:49:53,696 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:49:53,697 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:49:53,697 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:49:53,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,735 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,736 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,737 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,738 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,739 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,740 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,741 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,742 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,743 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,744 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,745 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,745 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,745 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,745 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,746 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,746 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,746 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,747 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,748 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,749 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,750 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,751 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,752 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,753 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,757 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,759 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,760 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,761 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,764 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,765 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,766 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,767 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,769 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,781 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,782 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,784 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,785 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:49:53,789 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 00:49:53,831 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:49:53,835 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:49:53,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 00:49:53,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 228 places, 235 transitions, 494 flow [2022-01-19 00:49:53,917 INFO L129 PetriNetUnfolder]: 17/232 cut-off events. [2022-01-19 00:49:53,918 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:49:53,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 232 events. 17/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 509 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2022-01-19 00:49:53,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 235 transitions, 494 flow [2022-01-19 00:49:53,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 221 transitions, 460 flow [2022-01-19 00:49:53,964 INFO L129 PetriNetUnfolder]: 17/220 cut-off events. [2022-01-19 00:49:53,964 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:49:53,964 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:53,964 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:53,965 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 922899840, now seen corresponding path program 1 times [2022-01-19 00:49:53,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:53,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997972610] [2022-01-19 00:49:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:53,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:54,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:54,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997972610] [2022-01-19 00:49:54,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997972610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:54,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:54,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:54,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780186943] [2022-01-19 00:49:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:54,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:54,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:54,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:54,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 235 [2022-01-19 00:49:54,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 221 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:54,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 235 [2022-01-19 00:49:54,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:54,344 INFO L129 PetriNetUnfolder]: 42/624 cut-off events. [2022-01-19 00:49:54,344 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-01-19 00:49:54,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 624 events. 42/624 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3570 event pairs, 7 based on Foata normal form. 42/601 useless extension candidates. Maximal degree in co-relation 541. Up to 29 conditions per place. [2022-01-19 00:49:54,353 INFO L132 encePairwiseOnDemand]: 221/235 looper letters, 15 selfloop transitions, 4 changer transitions 2/220 dead transitions. [2022-01-19 00:49:54,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 511 flow [2022-01-19 00:49:54,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-01-19 00:49:54,364 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9631205673758865 [2022-01-19 00:49:54,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-01-19 00:49:54,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-01-19 00:49:54,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:54,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-01-19 00:49:54,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,382 INFO L186 Difference]: Start difference. First operand has 214 places, 221 transitions, 460 flow. Second operand 3 states and 679 transitions. [2022-01-19 00:49:54,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 511 flow [2022-01-19 00:49:54,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 220 transitions, 489 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:49:54,390 INFO L242 Difference]: Finished difference. Result has 212 places, 213 transitions, 456 flow [2022-01-19 00:49:54,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=212, PETRI_TRANSITIONS=213} [2022-01-19 00:49:54,395 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, -2 predicate places. [2022-01-19 00:49:54,395 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 213 transitions, 456 flow [2022-01-19 00:49:54,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,396 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:54,396 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:54,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:49:54,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash 561065498, now seen corresponding path program 1 times [2022-01-19 00:49:54,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:54,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638531095] [2022-01-19 00:49:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:54,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:54,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:54,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638531095] [2022-01-19 00:49:54,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638531095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:54,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:54,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:54,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88479030] [2022-01-19 00:49:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:54,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:54,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:54,514 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 235 [2022-01-19 00:49:54,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 213 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:54,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 235 [2022-01-19 00:49:54,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:54,591 INFO L129 PetriNetUnfolder]: 36/549 cut-off events. [2022-01-19 00:49:54,591 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 00:49:54,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 549 events. 36/549 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2885 event pairs, 7 based on Foata normal form. 5/509 useless extension candidates. Maximal degree in co-relation 429. Up to 24 conditions per place. [2022-01-19 00:49:54,596 INFO L132 encePairwiseOnDemand]: 231/235 looper letters, 19 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2022-01-19 00:49:54,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 220 transitions, 521 flow [2022-01-19 00:49:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2022-01-19 00:49:54,598 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9404255319148936 [2022-01-19 00:49:54,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2022-01-19 00:49:54,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2022-01-19 00:49:54,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:54,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2022-01-19 00:49:54,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,604 INFO L186 Difference]: Start difference. First operand has 212 places, 213 transitions, 456 flow. Second operand 3 states and 663 transitions. [2022-01-19 00:49:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 220 transitions, 521 flow [2022-01-19 00:49:54,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 220 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:54,612 INFO L242 Difference]: Finished difference. Result has 212 places, 215 transitions, 472 flow [2022-01-19 00:49:54,612 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=212, PETRI_TRANSITIONS=215} [2022-01-19 00:49:54,613 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, -2 predicate places. [2022-01-19 00:49:54,613 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 215 transitions, 472 flow [2022-01-19 00:49:54,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,614 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:54,614 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:54,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:49:54,615 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:54,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1061366140, now seen corresponding path program 1 times [2022-01-19 00:49:54,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:54,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110200309] [2022-01-19 00:49:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:54,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:54,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:54,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110200309] [2022-01-19 00:49:54,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110200309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:54,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:54,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:54,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617230259] [2022-01-19 00:49:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:54,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:54,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:54,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:54,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 235 [2022-01-19 00:49:54,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 215 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:54,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 235 [2022-01-19 00:49:54,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:54,830 INFO L129 PetriNetUnfolder]: 105/1640 cut-off events. [2022-01-19 00:49:54,830 INFO L130 PetriNetUnfolder]: For 66/84 co-relation queries the response was YES. [2022-01-19 00:49:54,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1640 events. 105/1640 cut-off events. For 66/84 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 14315 event pairs, 32 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 880. Up to 112 conditions per place. [2022-01-19 00:49:54,841 INFO L132 encePairwiseOnDemand]: 227/235 looper letters, 20 selfloop transitions, 4 changer transitions 0/223 dead transitions. [2022-01-19 00:49:54,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 223 transitions, 540 flow [2022-01-19 00:49:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-01-19 00:49:54,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-01-19 00:49:54,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2022-01-19 00:49:54,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2022-01-19 00:49:54,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:54,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2022-01-19 00:49:54,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,851 INFO L186 Difference]: Start difference. First operand has 212 places, 215 transitions, 472 flow. Second operand 3 states and 658 transitions. [2022-01-19 00:49:54,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 223 transitions, 540 flow [2022-01-19 00:49:54,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 223 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:54,855 INFO L242 Difference]: Finished difference. Result has 215 places, 219 transitions, 506 flow [2022-01-19 00:49:54,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=215, PETRI_TRANSITIONS=219} [2022-01-19 00:49:54,857 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 1 predicate places. [2022-01-19 00:49:54,857 INFO L470 AbstractCegarLoop]: Abstraction has has 215 places, 219 transitions, 506 flow [2022-01-19 00:49:54,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,858 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:54,858 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:54,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:49:54,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:54,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1317949202, now seen corresponding path program 2 times [2022-01-19 00:49:54,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:54,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003343165] [2022-01-19 00:49:54,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:54,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:54,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003343165] [2022-01-19 00:49:54,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003343165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:54,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:54,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:54,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875917405] [2022-01-19 00:49:54,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:54,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:54,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:54,939 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 235 [2022-01-19 00:49:54,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 219 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:54,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:54,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 235 [2022-01-19 00:49:54,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:55,057 INFO L129 PetriNetUnfolder]: 84/1083 cut-off events. [2022-01-19 00:49:55,057 INFO L130 PetriNetUnfolder]: For 196/205 co-relation queries the response was YES. [2022-01-19 00:49:55,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1083 events. 84/1083 cut-off events. For 196/205 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7515 event pairs, 26 based on Foata normal form. 24/1023 useless extension candidates. Maximal degree in co-relation 584. Up to 73 conditions per place. [2022-01-19 00:49:55,066 INFO L132 encePairwiseOnDemand]: 225/235 looper letters, 22 selfloop transitions, 6 changer transitions 0/227 dead transitions. [2022-01-19 00:49:55,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 227 transitions, 590 flow [2022-01-19 00:49:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-01-19 00:49:55,068 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-01-19 00:49:55,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2022-01-19 00:49:55,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2022-01-19 00:49:55,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:55,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2022-01-19 00:49:55,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,071 INFO L186 Difference]: Start difference. First operand has 215 places, 219 transitions, 506 flow. Second operand 3 states and 658 transitions. [2022-01-19 00:49:55,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 227 transitions, 590 flow [2022-01-19 00:49:55,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 227 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:49:55,076 INFO L242 Difference]: Finished difference. Result has 218 places, 223 transitions, 558 flow [2022-01-19 00:49:55,076 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=218, PETRI_TRANSITIONS=223} [2022-01-19 00:49:55,077 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 4 predicate places. [2022-01-19 00:49:55,078 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 223 transitions, 558 flow [2022-01-19 00:49:55,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,078 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:55,078 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:55,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:49:55,078 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1660317322, now seen corresponding path program 1 times [2022-01-19 00:49:55,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243809614] [2022-01-19 00:49:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:55,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:55,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:55,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243809614] [2022-01-19 00:49:55,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243809614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:55,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:55,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:49:55,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535348033] [2022-01-19 00:49:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:55,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:49:55,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:49:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:49:55,219 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 235 [2022-01-19 00:49:55,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 223 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 204.85714285714286) internal successors, (1434), 7 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:55,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 235 [2022-01-19 00:49:55,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:55,389 INFO L129 PetriNetUnfolder]: 73/968 cut-off events. [2022-01-19 00:49:55,389 INFO L130 PetriNetUnfolder]: For 87/268 co-relation queries the response was YES. [2022-01-19 00:49:55,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 968 events. 73/968 cut-off events. For 87/268 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6398 event pairs, 18 based on Foata normal form. 7/912 useless extension candidates. Maximal degree in co-relation 910. Up to 92 conditions per place. [2022-01-19 00:49:55,396 INFO L132 encePairwiseOnDemand]: 227/235 looper letters, 25 selfloop transitions, 3 changer transitions 14/243 dead transitions. [2022-01-19 00:49:55,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 243 transitions, 695 flow [2022-01-19 00:49:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:49:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:49:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1861 transitions. [2022-01-19 00:49:55,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8799054373522459 [2022-01-19 00:49:55,399 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1861 transitions. [2022-01-19 00:49:55,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1861 transitions. [2022-01-19 00:49:55,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:55,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1861 transitions. [2022-01-19 00:49:55,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 206.77777777777777) internal successors, (1861), 9 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,407 INFO L186 Difference]: Start difference. First operand has 218 places, 223 transitions, 558 flow. Second operand 9 states and 1861 transitions. [2022-01-19 00:49:55,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 243 transitions, 695 flow [2022-01-19 00:49:55,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 243 transitions, 675 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:55,413 INFO L242 Difference]: Finished difference. Result has 231 places, 225 transitions, 567 flow [2022-01-19 00:49:55,414 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=567, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2022-01-19 00:49:55,415 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 17 predicate places. [2022-01-19 00:49:55,415 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 567 flow [2022-01-19 00:49:55,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 204.85714285714286) internal successors, (1434), 7 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:55,416 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:55,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:49:55,417 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -378725916, now seen corresponding path program 1 times [2022-01-19 00:49:55,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518817545] [2022-01-19 00:49:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:55,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:55,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:55,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518817545] [2022-01-19 00:49:55,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518817545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:55,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:55,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:49:55,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927859857] [2022-01-19 00:49:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:55,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:49:55,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:55,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:49:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:49:55,533 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:49:55,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 567 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:55,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:55,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:49:55,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:56,050 INFO L129 PetriNetUnfolder]: 699/2510 cut-off events. [2022-01-19 00:49:56,050 INFO L130 PetriNetUnfolder]: For 255/314 co-relation queries the response was YES. [2022-01-19 00:49:56,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 2510 events. 699/2510 cut-off events. For 255/314 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22083 event pairs, 180 based on Foata normal form. 1/2303 useless extension candidates. Maximal degree in co-relation 4033. Up to 518 conditions per place. [2022-01-19 00:49:56,069 INFO L132 encePairwiseOnDemand]: 221/235 looper letters, 78 selfloop transitions, 46 changer transitions 20/339 dead transitions. [2022-01-19 00:49:56,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 339 transitions, 1126 flow [2022-01-19 00:49:56,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:49:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:49:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4413 transitions. [2022-01-19 00:49:56,076 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.85357833655706 [2022-01-19 00:49:56,076 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4413 transitions. [2022-01-19 00:49:56,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4413 transitions. [2022-01-19 00:49:56,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:56,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4413 transitions. [2022-01-19 00:49:56,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 200.5909090909091) internal successors, (4413), 22 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,094 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,094 INFO L186 Difference]: Start difference. First operand has 231 places, 225 transitions, 567 flow. Second operand 22 states and 4413 transitions. [2022-01-19 00:49:56,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 339 transitions, 1126 flow [2022-01-19 00:49:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 339 transitions, 1105 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:56,100 INFO L242 Difference]: Finished difference. Result has 257 places, 270 transitions, 847 flow [2022-01-19 00:49:56,100 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=847, PETRI_PLACES=257, PETRI_TRANSITIONS=270} [2022-01-19 00:49:56,102 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 43 predicate places. [2022-01-19 00:49:56,102 INFO L470 AbstractCegarLoop]: Abstraction has has 257 places, 270 transitions, 847 flow [2022-01-19 00:49:56,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,103 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:56,103 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:56,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:49:56,103 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash -827278968, now seen corresponding path program 1 times [2022-01-19 00:49:56,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:56,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011398866] [2022-01-19 00:49:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:56,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:56,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011398866] [2022-01-19 00:49:56,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011398866] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:56,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:56,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:56,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607861478] [2022-01-19 00:49:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:56,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:56,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:56,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:56,138 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 235 [2022-01-19 00:49:56,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 270 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:56,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 235 [2022-01-19 00:49:56,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:56,322 INFO L129 PetriNetUnfolder]: 247/2271 cut-off events. [2022-01-19 00:49:56,323 INFO L130 PetriNetUnfolder]: For 1464/1605 co-relation queries the response was YES. [2022-01-19 00:49:56,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 2271 events. 247/2271 cut-off events. For 1464/1605 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 19624 event pairs, 33 based on Foata normal form. 24/2156 useless extension candidates. Maximal degree in co-relation 3917. Up to 274 conditions per place. [2022-01-19 00:49:56,340 INFO L132 encePairwiseOnDemand]: 227/235 looper letters, 16 selfloop transitions, 5 changer transitions 1/278 dead transitions. [2022-01-19 00:49:56,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 278 transitions, 912 flow [2022-01-19 00:49:56,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-01-19 00:49:56,342 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9375886524822695 [2022-01-19 00:49:56,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-01-19 00:49:56,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-01-19 00:49:56,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:56,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-01-19 00:49:56,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,345 INFO L186 Difference]: Start difference. First operand has 257 places, 270 transitions, 847 flow. Second operand 3 states and 661 transitions. [2022-01-19 00:49:56,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 278 transitions, 912 flow [2022-01-19 00:49:56,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 278 transitions, 908 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:56,355 INFO L242 Difference]: Finished difference. Result has 257 places, 272 transitions, 877 flow [2022-01-19 00:49:56,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=257, PETRI_TRANSITIONS=272} [2022-01-19 00:49:56,356 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 43 predicate places. [2022-01-19 00:49:56,356 INFO L470 AbstractCegarLoop]: Abstraction has has 257 places, 272 transitions, 877 flow [2022-01-19 00:49:56,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,356 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:56,357 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:56,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:49:56,357 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 794271370, now seen corresponding path program 1 times [2022-01-19 00:49:56,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:56,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275825950] [2022-01-19 00:49:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:56,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:56,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:56,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275825950] [2022-01-19 00:49:56,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275825950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:56,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:56,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:49:56,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347272402] [2022-01-19 00:49:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:56,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:49:56,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:56,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:49:56,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:49:56,454 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:49:56,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 272 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:56,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:56,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:49:56,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:57,002 INFO L129 PetriNetUnfolder]: 1348/4464 cut-off events. [2022-01-19 00:49:57,003 INFO L130 PetriNetUnfolder]: For 4459/4563 co-relation queries the response was YES. [2022-01-19 00:49:57,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10881 conditions, 4464 events. 1348/4464 cut-off events. For 4459/4563 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 43206 event pairs, 681 based on Foata normal form. 4/4060 useless extension candidates. Maximal degree in co-relation 9443. Up to 1917 conditions per place. [2022-01-19 00:49:57,043 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 103 selfloop transitions, 24 changer transitions 16/340 dead transitions. [2022-01-19 00:49:57,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 340 transitions, 1462 flow [2022-01-19 00:49:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:49:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:49:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3201 transitions. [2022-01-19 00:49:57,048 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8513297872340425 [2022-01-19 00:49:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3201 transitions. [2022-01-19 00:49:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3201 transitions. [2022-01-19 00:49:57,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:57,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3201 transitions. [2022-01-19 00:49:57,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 200.0625) internal successors, (3201), 16 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,059 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,059 INFO L186 Difference]: Start difference. First operand has 257 places, 272 transitions, 877 flow. Second operand 16 states and 3201 transitions. [2022-01-19 00:49:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 340 transitions, 1462 flow [2022-01-19 00:49:57,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 340 transitions, 1452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:57,081 INFO L242 Difference]: Finished difference. Result has 281 places, 294 transitions, 1086 flow [2022-01-19 00:49:57,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1086, PETRI_PLACES=281, PETRI_TRANSITIONS=294} [2022-01-19 00:49:57,082 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 67 predicate places. [2022-01-19 00:49:57,082 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 294 transitions, 1086 flow [2022-01-19 00:49:57,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,083 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:57,083 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:57,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:49:57,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1970093106, now seen corresponding path program 1 times [2022-01-19 00:49:57,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:57,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241495335] [2022-01-19 00:49:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:57,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:57,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:57,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241495335] [2022-01-19 00:49:57,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241495335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:57,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:57,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:49:57,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065722631] [2022-01-19 00:49:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:57,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:49:57,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:49:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:49:57,140 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 235 [2022-01-19 00:49:57,141 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 294 transitions, 1086 flow. Second operand has 7 states, 7 states have (on average 204.85714285714286) internal successors, (1434), 7 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:57,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 235 [2022-01-19 00:49:57,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:57,418 INFO L129 PetriNetUnfolder]: 338/2548 cut-off events. [2022-01-19 00:49:57,418 INFO L130 PetriNetUnfolder]: For 3217/3462 co-relation queries the response was YES. [2022-01-19 00:49:57,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5956 conditions, 2548 events. 338/2548 cut-off events. For 3217/3462 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 24004 event pairs, 90 based on Foata normal form. 30/2429 useless extension candidates. Maximal degree in co-relation 5891. Up to 376 conditions per place. [2022-01-19 00:49:57,439 INFO L132 encePairwiseOnDemand]: 227/235 looper letters, 27 selfloop transitions, 3 changer transitions 14/314 dead transitions. [2022-01-19 00:49:57,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 314 transitions, 1231 flow [2022-01-19 00:49:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:49:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:49:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1861 transitions. [2022-01-19 00:49:57,443 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8799054373522459 [2022-01-19 00:49:57,443 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1861 transitions. [2022-01-19 00:49:57,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1861 transitions. [2022-01-19 00:49:57,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:57,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1861 transitions. [2022-01-19 00:49:57,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 206.77777777777777) internal successors, (1861), 9 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,449 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,449 INFO L186 Difference]: Start difference. First operand has 281 places, 294 transitions, 1086 flow. Second operand 9 states and 1861 transitions. [2022-01-19 00:49:57,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 314 transitions, 1231 flow [2022-01-19 00:49:57,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 314 transitions, 1189 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:57,468 INFO L242 Difference]: Finished difference. Result has 292 places, 296 transitions, 1075 flow [2022-01-19 00:49:57,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1075, PETRI_PLACES=292, PETRI_TRANSITIONS=296} [2022-01-19 00:49:57,469 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 78 predicate places. [2022-01-19 00:49:57,469 INFO L470 AbstractCegarLoop]: Abstraction has has 292 places, 296 transitions, 1075 flow [2022-01-19 00:49:57,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 204.85714285714286) internal successors, (1434), 7 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,470 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:57,470 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:57,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:49:57,470 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2141648136, now seen corresponding path program 2 times [2022-01-19 00:49:57,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:57,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125905493] [2022-01-19 00:49:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:57,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:57,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125905493] [2022-01-19 00:49:57,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125905493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:57,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:57,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:49:57,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609970510] [2022-01-19 00:49:57,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:57,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:49:57,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:57,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:49:57,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:49:57,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 235 [2022-01-19 00:49:57,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 296 transitions, 1075 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:57,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 235 [2022-01-19 00:49:57,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:57,705 INFO L129 PetriNetUnfolder]: 272/2148 cut-off events. [2022-01-19 00:49:57,706 INFO L130 PetriNetUnfolder]: For 2326/2455 co-relation queries the response was YES. [2022-01-19 00:49:57,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 2148 events. 272/2148 cut-off events. For 2326/2455 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18696 event pairs, 66 based on Foata normal form. 5/2017 useless extension candidates. Maximal degree in co-relation 4669. Up to 323 conditions per place. [2022-01-19 00:49:57,720 INFO L132 encePairwiseOnDemand]: 229/235 looper letters, 19 selfloop transitions, 2 changer transitions 9/304 dead transitions. [2022-01-19 00:49:57,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 304 transitions, 1150 flow [2022-01-19 00:49:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:49:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:49:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-01-19 00:49:57,722 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9375886524822695 [2022-01-19 00:49:57,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-01-19 00:49:57,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-01-19 00:49:57,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:57,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-01-19 00:49:57,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,724 INFO L186 Difference]: Start difference. First operand has 292 places, 296 transitions, 1075 flow. Second operand 3 states and 661 transitions. [2022-01-19 00:49:57,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 304 transitions, 1150 flow [2022-01-19 00:49:57,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 304 transitions, 1139 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-01-19 00:49:57,737 INFO L242 Difference]: Finished difference. Result has 287 places, 290 transitions, 1048 flow [2022-01-19 00:49:57,737 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1048, PETRI_PLACES=287, PETRI_TRANSITIONS=290} [2022-01-19 00:49:57,738 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 73 predicate places. [2022-01-19 00:49:57,738 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 290 transitions, 1048 flow [2022-01-19 00:49:57,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:57,738 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:57,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:49:57,738 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:57,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1017923280, now seen corresponding path program 2 times [2022-01-19 00:49:57,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:57,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199972280] [2022-01-19 00:49:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:57,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:57,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:57,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199972280] [2022-01-19 00:49:57,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199972280] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:57,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:57,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:49:57,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633746365] [2022-01-19 00:49:57,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:57,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:49:57,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:49:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:49:57,822 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:49:57,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 290 transitions, 1048 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:57,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:57,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:49:57,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:58,355 INFO L129 PetriNetUnfolder]: 909/3496 cut-off events. [2022-01-19 00:49:58,355 INFO L130 PetriNetUnfolder]: For 6993/7098 co-relation queries the response was YES. [2022-01-19 00:49:58,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10260 conditions, 3496 events. 909/3496 cut-off events. For 6993/7098 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 33239 event pairs, 396 based on Foata normal form. 5/3323 useless extension candidates. Maximal degree in co-relation 10027. Up to 1230 conditions per place. [2022-01-19 00:49:58,387 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 119 selfloop transitions, 33 changer transitions 17/362 dead transitions. [2022-01-19 00:49:58,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 362 transitions, 1874 flow [2022-01-19 00:49:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:49:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:49:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3401 transitions. [2022-01-19 00:49:58,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8513141426783479 [2022-01-19 00:49:58,392 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3401 transitions. [2022-01-19 00:49:58,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3401 transitions. [2022-01-19 00:49:58,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:58,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3401 transitions. [2022-01-19 00:49:58,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 200.05882352941177) internal successors, (3401), 17 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,400 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,400 INFO L186 Difference]: Start difference. First operand has 287 places, 290 transitions, 1048 flow. Second operand 17 states and 3401 transitions. [2022-01-19 00:49:58,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 362 transitions, 1874 flow [2022-01-19 00:49:58,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 362 transitions, 1856 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-01-19 00:49:58,432 INFO L242 Difference]: Finished difference. Result has 299 places, 319 transitions, 1430 flow [2022-01-19 00:49:58,432 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1430, PETRI_PLACES=299, PETRI_TRANSITIONS=319} [2022-01-19 00:49:58,432 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 85 predicate places. [2022-01-19 00:49:58,432 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 319 transitions, 1430 flow [2022-01-19 00:49:58,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,433 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:58,433 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:58,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:49:58,433 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1787524280, now seen corresponding path program 3 times [2022-01-19 00:49:58,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:58,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661782029] [2022-01-19 00:49:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:58,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:58,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:58,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661782029] [2022-01-19 00:49:58,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661782029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:58,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:58,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:49:58,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386092915] [2022-01-19 00:49:58,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:58,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:49:58,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:49:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:49:58,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:49:58,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 319 transitions, 1430 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:58,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:58,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:49:58,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:59,065 INFO L129 PetriNetUnfolder]: 956/3673 cut-off events. [2022-01-19 00:49:59,065 INFO L130 PetriNetUnfolder]: For 13840/13948 co-relation queries the response was YES. [2022-01-19 00:49:59,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12577 conditions, 3673 events. 956/3673 cut-off events. For 13840/13948 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 35705 event pairs, 356 based on Foata normal form. 2/3506 useless extension candidates. Maximal degree in co-relation 12519. Up to 1115 conditions per place. [2022-01-19 00:49:59,101 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 172 selfloop transitions, 52 changer transitions 28/445 dead transitions. [2022-01-19 00:49:59,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 445 transitions, 2862 flow [2022-01-19 00:49:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:49:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:49:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4791 transitions. [2022-01-19 00:49:59,107 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494680851063829 [2022-01-19 00:49:59,107 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4791 transitions. [2022-01-19 00:49:59,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4791 transitions. [2022-01-19 00:49:59,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:59,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4791 transitions. [2022-01-19 00:49:59,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 199.625) internal successors, (4791), 24 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,118 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,118 INFO L186 Difference]: Start difference. First operand has 299 places, 319 transitions, 1430 flow. Second operand 24 states and 4791 transitions. [2022-01-19 00:49:59,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 445 transitions, 2862 flow [2022-01-19 00:49:59,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 445 transitions, 2682 flow, removed 90 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:59,195 INFO L242 Difference]: Finished difference. Result has 338 places, 349 transitions, 1871 flow [2022-01-19 00:49:59,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1871, PETRI_PLACES=338, PETRI_TRANSITIONS=349} [2022-01-19 00:49:59,197 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 124 predicate places. [2022-01-19 00:49:59,197 INFO L470 AbstractCegarLoop]: Abstraction has has 338 places, 349 transitions, 1871 flow [2022-01-19 00:49:59,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:59,198 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:59,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:49:59,198 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash 628042996, now seen corresponding path program 4 times [2022-01-19 00:49:59,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:59,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64970630] [2022-01-19 00:49:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:59,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:59,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64970630] [2022-01-19 00:49:59,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64970630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:59,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:59,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:49:59,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635662490] [2022-01-19 00:49:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:59,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:49:59,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:59,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:49:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:49:59,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:49:59,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 349 transitions, 1871 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:59,288 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:49:59,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:59,896 INFO L129 PetriNetUnfolder]: 1022/4043 cut-off events. [2022-01-19 00:49:59,896 INFO L130 PetriNetUnfolder]: For 22848/22957 co-relation queries the response was YES. [2022-01-19 00:49:59,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15322 conditions, 4043 events. 1022/4043 cut-off events. For 22848/22957 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 40278 event pairs, 435 based on Foata normal form. 4/3865 useless extension candidates. Maximal degree in co-relation 15245. Up to 1385 conditions per place. [2022-01-19 00:49:59,936 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 152 selfloop transitions, 59 changer transitions 14/418 dead transitions. [2022-01-19 00:49:59,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 418 transitions, 3053 flow [2022-01-19 00:49:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:49:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:49:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3198 transitions. [2022-01-19 00:49:59,939 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.850531914893617 [2022-01-19 00:49:59,939 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3198 transitions. [2022-01-19 00:49:59,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3198 transitions. [2022-01-19 00:49:59,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:59,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3198 transitions. [2022-01-19 00:49:59,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 199.875) internal successors, (3198), 16 states have internal predecessors, (3198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,945 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:59,945 INFO L186 Difference]: Start difference. First operand has 338 places, 349 transitions, 1871 flow. Second operand 16 states and 3198 transitions. [2022-01-19 00:49:59,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 418 transitions, 3053 flow [2022-01-19 00:50:00,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 418 transitions, 2773 flow, removed 140 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:00,046 INFO L242 Difference]: Finished difference. Result has 360 places, 369 transitions, 2147 flow [2022-01-19 00:50:00,047 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2147, PETRI_PLACES=360, PETRI_TRANSITIONS=369} [2022-01-19 00:50:00,047 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 146 predicate places. [2022-01-19 00:50:00,047 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 369 transitions, 2147 flow [2022-01-19 00:50:00,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,048 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:00,048 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:00,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:50:00,048 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -285307232, now seen corresponding path program 5 times [2022-01-19 00:50:00,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:00,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005795289] [2022-01-19 00:50:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:00,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:00,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:00,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005795289] [2022-01-19 00:50:00,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005795289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:00,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:00,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:00,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376212225] [2022-01-19 00:50:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:00,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:00,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:00,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:00,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:00,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 369 transitions, 2147 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:00,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:00,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:00,840 INFO L129 PetriNetUnfolder]: 1085/4359 cut-off events. [2022-01-19 00:50:00,841 INFO L130 PetriNetUnfolder]: For 25184/25302 co-relation queries the response was YES. [2022-01-19 00:50:00,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16820 conditions, 4359 events. 1085/4359 cut-off events. For 25184/25302 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 44919 event pairs, 457 based on Foata normal form. 2/4174 useless extension candidates. Maximal degree in co-relation 16733. Up to 1423 conditions per place. [2022-01-19 00:50:00,887 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 175 selfloop transitions, 57 changer transitions 23/448 dead transitions. [2022-01-19 00:50:00,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 448 transitions, 3605 flow [2022-01-19 00:50:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:50:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:50:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4190 transitions. [2022-01-19 00:50:00,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8490374873353597 [2022-01-19 00:50:00,891 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4190 transitions. [2022-01-19 00:50:00,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4190 transitions. [2022-01-19 00:50:00,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:00,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4190 transitions. [2022-01-19 00:50:00,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 199.52380952380952) internal successors, (4190), 21 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,975 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:00,975 INFO L186 Difference]: Start difference. First operand has 360 places, 369 transitions, 2147 flow. Second operand 21 states and 4190 transitions. [2022-01-19 00:50:00,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 448 transitions, 3605 flow [2022-01-19 00:50:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 448 transitions, 3404 flow, removed 89 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:01,110 INFO L242 Difference]: Finished difference. Result has 390 places, 400 transitions, 2737 flow [2022-01-19 00:50:01,111 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2737, PETRI_PLACES=390, PETRI_TRANSITIONS=400} [2022-01-19 00:50:01,111 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 176 predicate places. [2022-01-19 00:50:01,111 INFO L470 AbstractCegarLoop]: Abstraction has has 390 places, 400 transitions, 2737 flow [2022-01-19 00:50:01,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:01,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:01,112 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:01,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:50:01,112 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash -674420230, now seen corresponding path program 6 times [2022-01-19 00:50:01,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:01,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570765641] [2022-01-19 00:50:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:01,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:01,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570765641] [2022-01-19 00:50:01,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570765641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:01,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:01,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:01,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656147855] [2022-01-19 00:50:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:01,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:01,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:01,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:01,191 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:01,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 400 transitions, 2737 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:01,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:01,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:01,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:02,169 INFO L129 PetriNetUnfolder]: 1128/4533 cut-off events. [2022-01-19 00:50:02,169 INFO L130 PetriNetUnfolder]: For 33947/34077 co-relation queries the response was YES. [2022-01-19 00:50:02,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18730 conditions, 4533 events. 1128/4533 cut-off events. For 33947/34077 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 47272 event pairs, 444 based on Foata normal form. 10/4357 useless extension candidates. Maximal degree in co-relation 18630. Up to 1478 conditions per place. [2022-01-19 00:50:02,220 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 176 selfloop transitions, 87 changer transitions 24/480 dead transitions. [2022-01-19 00:50:02,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 480 transitions, 4186 flow [2022-01-19 00:50:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:50:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:50:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4385 transitions. [2022-01-19 00:50:02,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8481624758220503 [2022-01-19 00:50:02,224 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4385 transitions. [2022-01-19 00:50:02,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4385 transitions. [2022-01-19 00:50:02,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:02,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4385 transitions. [2022-01-19 00:50:02,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 199.3181818181818) internal successors, (4385), 22 states have internal predecessors, (4385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,234 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,234 INFO L186 Difference]: Start difference. First operand has 390 places, 400 transitions, 2737 flow. Second operand 22 states and 4385 transitions. [2022-01-19 00:50:02,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 480 transitions, 4186 flow [2022-01-19 00:50:02,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 480 transitions, 3864 flow, removed 161 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:02,416 INFO L242 Difference]: Finished difference. Result has 420 places, 424 transitions, 3103 flow [2022-01-19 00:50:02,416 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3103, PETRI_PLACES=420, PETRI_TRANSITIONS=424} [2022-01-19 00:50:02,417 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 206 predicate places. [2022-01-19 00:50:02,417 INFO L470 AbstractCegarLoop]: Abstraction has has 420 places, 424 transitions, 3103 flow [2022-01-19 00:50:02,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:02,418 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:02,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:50:02,418 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash -891029562, now seen corresponding path program 7 times [2022-01-19 00:50:02,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:02,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354083787] [2022-01-19 00:50:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:02,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:02,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:02,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354083787] [2022-01-19 00:50:02,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354083787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:02,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:02,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:02,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994962685] [2022-01-19 00:50:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:02,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:02,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:02,488 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:02,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 424 transitions, 3103 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:02,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:02,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:03,490 INFO L129 PetriNetUnfolder]: 1126/4541 cut-off events. [2022-01-19 00:50:03,490 INFO L130 PetriNetUnfolder]: For 37897/38036 co-relation queries the response was YES. [2022-01-19 00:50:03,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19149 conditions, 4541 events. 1126/4541 cut-off events. For 37897/38036 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 47473 event pairs, 452 based on Foata normal form. 10/4362 useless extension candidates. Maximal degree in co-relation 19037. Up to 1539 conditions per place. [2022-01-19 00:50:03,541 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 175 selfloop transitions, 93 changer transitions 23/484 dead transitions. [2022-01-19 00:50:03,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 484 transitions, 4367 flow [2022-01-19 00:50:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3593 transitions. [2022-01-19 00:50:03,544 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494089834515366 [2022-01-19 00:50:03,544 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3593 transitions. [2022-01-19 00:50:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3593 transitions. [2022-01-19 00:50:03,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:03,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3593 transitions. [2022-01-19 00:50:03,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.61111111111111) internal successors, (3593), 18 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,552 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,552 INFO L186 Difference]: Start difference. First operand has 420 places, 424 transitions, 3103 flow. Second operand 18 states and 3593 transitions. [2022-01-19 00:50:03,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 484 transitions, 4367 flow [2022-01-19 00:50:03,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 484 transitions, 4165 flow, removed 99 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:03,755 INFO L242 Difference]: Finished difference. Result has 439 places, 440 transitions, 3514 flow [2022-01-19 00:50:03,755 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2921, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3514, PETRI_PLACES=439, PETRI_TRANSITIONS=440} [2022-01-19 00:50:03,756 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 225 predicate places. [2022-01-19 00:50:03,756 INFO L470 AbstractCegarLoop]: Abstraction has has 439 places, 440 transitions, 3514 flow [2022-01-19 00:50:03,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,756 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:03,756 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:03,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:50:03,761 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1368689700, now seen corresponding path program 8 times [2022-01-19 00:50:03,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:03,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962058348] [2022-01-19 00:50:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:03,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:03,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:03,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962058348] [2022-01-19 00:50:03,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962058348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:03,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:03,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:03,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476729835] [2022-01-19 00:50:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:03,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:03,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:03,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:03,847 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:03,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 440 transitions, 3514 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:03,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:03,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:04,823 INFO L129 PetriNetUnfolder]: 1190/4797 cut-off events. [2022-01-19 00:50:04,823 INFO L130 PetriNetUnfolder]: For 46454/46595 co-relation queries the response was YES. [2022-01-19 00:50:04,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21265 conditions, 4797 events. 1190/4797 cut-off events. For 46454/46595 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 51100 event pairs, 466 based on Foata normal form. 11/4620 useless extension candidates. Maximal degree in co-relation 21148. Up to 1589 conditions per place. [2022-01-19 00:50:04,961 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 193 selfloop transitions, 98 changer transitions 16/500 dead transitions. [2022-01-19 00:50:04,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 500 transitions, 4923 flow [2022-01-19 00:50:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3593 transitions. [2022-01-19 00:50:04,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494089834515366 [2022-01-19 00:50:04,964 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3593 transitions. [2022-01-19 00:50:04,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3593 transitions. [2022-01-19 00:50:04,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:04,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3593 transitions. [2022-01-19 00:50:04,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.61111111111111) internal successors, (3593), 18 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:04,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:04,971 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:04,972 INFO L186 Difference]: Start difference. First operand has 439 places, 440 transitions, 3514 flow. Second operand 18 states and 3593 transitions. [2022-01-19 00:50:04,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 500 transitions, 4923 flow [2022-01-19 00:50:05,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 500 transitions, 4609 flow, removed 137 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:05,208 INFO L242 Difference]: Finished difference. Result has 459 places, 467 transitions, 4100 flow [2022-01-19 00:50:05,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4100, PETRI_PLACES=459, PETRI_TRANSITIONS=467} [2022-01-19 00:50:05,209 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 245 predicate places. [2022-01-19 00:50:05,209 INFO L470 AbstractCegarLoop]: Abstraction has has 459 places, 467 transitions, 4100 flow [2022-01-19 00:50:05,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:05,209 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:05,209 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:05,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:50:05,209 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash 35895206, now seen corresponding path program 9 times [2022-01-19 00:50:05,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:05,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960704820] [2022-01-19 00:50:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:05,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:05,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960704820] [2022-01-19 00:50:05,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960704820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:05,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:05,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:05,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765152177] [2022-01-19 00:50:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:05,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:05,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:05,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:05,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:05,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:05,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 467 transitions, 4100 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:05,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:05,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:05,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:06,468 INFO L129 PetriNetUnfolder]: 1235/5046 cut-off events. [2022-01-19 00:50:06,468 INFO L130 PetriNetUnfolder]: For 46899/47040 co-relation queries the response was YES. [2022-01-19 00:50:06,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22443 conditions, 5046 events. 1235/5046 cut-off events. For 46899/47040 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 54786 event pairs, 361 based on Foata normal form. 5/4881 useless extension candidates. Maximal degree in co-relation 22319. Up to 1101 conditions per place. [2022-01-19 00:50:06,527 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 235 selfloop transitions, 133 changer transitions 26/587 dead transitions. [2022-01-19 00:50:06,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 587 transitions, 6262 flow [2022-01-19 00:50:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:50:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:50:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4788 transitions. [2022-01-19 00:50:06,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8489361702127659 [2022-01-19 00:50:06,531 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4788 transitions. [2022-01-19 00:50:06,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4788 transitions. [2022-01-19 00:50:06,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:06,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4788 transitions. [2022-01-19 00:50:06,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 199.5) internal successors, (4788), 24 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:06,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:06,541 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:06,541 INFO L186 Difference]: Start difference. First operand has 459 places, 467 transitions, 4100 flow. Second operand 24 states and 4788 transitions. [2022-01-19 00:50:06,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 587 transitions, 6262 flow [2022-01-19 00:50:06,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 587 transitions, 6008 flow, removed 103 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:06,779 INFO L242 Difference]: Finished difference. Result has 496 places, 493 transitions, 4845 flow [2022-01-19 00:50:06,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3879, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4845, PETRI_PLACES=496, PETRI_TRANSITIONS=493} [2022-01-19 00:50:06,780 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 282 predicate places. [2022-01-19 00:50:06,780 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 493 transitions, 4845 flow [2022-01-19 00:50:06,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:06,781 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:06,781 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:06,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:50:06,781 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2045237596, now seen corresponding path program 10 times [2022-01-19 00:50:06,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:06,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443254673] [2022-01-19 00:50:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:06,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:06,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443254673] [2022-01-19 00:50:06,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443254673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:06,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:06,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:06,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785547618] [2022-01-19 00:50:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:06,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:06,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:06,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:06,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:06,875 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:06,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 493 transitions, 4845 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:06,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:06,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:06,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:08,070 INFO L129 PetriNetUnfolder]: 1273/5116 cut-off events. [2022-01-19 00:50:08,070 INFO L130 PetriNetUnfolder]: For 56577/56710 co-relation queries the response was YES. [2022-01-19 00:50:08,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24521 conditions, 5116 events. 1273/5116 cut-off events. For 56577/56710 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 55350 event pairs, 487 based on Foata normal form. 2/4923 useless extension candidates. Maximal degree in co-relation 24380. Up to 1660 conditions per place. [2022-01-19 00:50:08,192 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 235 selfloop transitions, 102 changer transitions 17/547 dead transitions. [2022-01-19 00:50:08,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 547 transitions, 6329 flow [2022-01-19 00:50:08,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3597 transitions. [2022-01-19 00:50:08,197 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.850354609929078 [2022-01-19 00:50:08,197 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3597 transitions. [2022-01-19 00:50:08,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3597 transitions. [2022-01-19 00:50:08,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:08,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3597 transitions. [2022-01-19 00:50:08,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.83333333333334) internal successors, (3597), 18 states have internal predecessors, (3597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,203 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,204 INFO L186 Difference]: Start difference. First operand has 496 places, 493 transitions, 4845 flow. Second operand 18 states and 3597 transitions. [2022-01-19 00:50:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 547 transitions, 6329 flow [2022-01-19 00:50:08,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 547 transitions, 6171 flow, removed 76 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:08,503 INFO L242 Difference]: Finished difference. Result has 516 places, 512 transitions, 5427 flow [2022-01-19 00:50:08,504 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4705, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5427, PETRI_PLACES=516, PETRI_TRANSITIONS=512} [2022-01-19 00:50:08,504 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 302 predicate places. [2022-01-19 00:50:08,504 INFO L470 AbstractCegarLoop]: Abstraction has has 516 places, 512 transitions, 5427 flow [2022-01-19 00:50:08,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:08,504 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:08,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:50:08,505 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -59391672, now seen corresponding path program 11 times [2022-01-19 00:50:08,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:08,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001681200] [2022-01-19 00:50:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:08,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:08,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001681200] [2022-01-19 00:50:08,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001681200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:08,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:08,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:08,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592148407] [2022-01-19 00:50:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:08,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:08,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:08,574 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:08,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 512 transitions, 5427 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:08,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:08,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:08,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:09,941 INFO L129 PetriNetUnfolder]: 1301/5452 cut-off events. [2022-01-19 00:50:09,941 INFO L130 PetriNetUnfolder]: For 57325/57458 co-relation queries the response was YES. [2022-01-19 00:50:09,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25869 conditions, 5452 events. 1301/5452 cut-off events. For 57325/57458 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 60833 event pairs, 474 based on Foata normal form. 2/5259 useless extension candidates. Maximal degree in co-relation 25722. Up to 1714 conditions per place. [2022-01-19 00:50:10,003 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 224 selfloop transitions, 136 changer transitions 19/572 dead transitions. [2022-01-19 00:50:10,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 572 transitions, 7030 flow [2022-01-19 00:50:10,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:50:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:50:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3988 transitions. [2022-01-19 00:50:10,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8485106382978723 [2022-01-19 00:50:10,006 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3988 transitions. [2022-01-19 00:50:10,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3988 transitions. [2022-01-19 00:50:10,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:10,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3988 transitions. [2022-01-19 00:50:10,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.4) internal successors, (3988), 20 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,012 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,012 INFO L186 Difference]: Start difference. First operand has 516 places, 512 transitions, 5427 flow. Second operand 20 states and 3988 transitions. [2022-01-19 00:50:10,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 572 transitions, 7030 flow [2022-01-19 00:50:10,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 572 transitions, 6808 flow, removed 111 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:10,348 INFO L242 Difference]: Finished difference. Result has 542 places, 532 transitions, 6059 flow [2022-01-19 00:50:10,349 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5221, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6059, PETRI_PLACES=542, PETRI_TRANSITIONS=532} [2022-01-19 00:50:10,349 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 328 predicate places. [2022-01-19 00:50:10,349 INFO L470 AbstractCegarLoop]: Abstraction has has 542 places, 532 transitions, 6059 flow [2022-01-19 00:50:10,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,349 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:10,350 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:10,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:50:10,350 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1703029322, now seen corresponding path program 12 times [2022-01-19 00:50:10,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295669745] [2022-01-19 00:50:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:10,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:10,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295669745] [2022-01-19 00:50:10,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295669745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:10,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:10,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:10,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044136937] [2022-01-19 00:50:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:10,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:10,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:10,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:10,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:10,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 532 transitions, 6059 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:10,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:10,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:10,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:11,709 INFO L129 PetriNetUnfolder]: 1306/5534 cut-off events. [2022-01-19 00:50:11,709 INFO L130 PetriNetUnfolder]: For 60417/60550 co-relation queries the response was YES. [2022-01-19 00:50:11,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26682 conditions, 5534 events. 1306/5534 cut-off events. For 60417/60550 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 61878 event pairs, 484 based on Foata normal form. 2/5344 useless extension candidates. Maximal degree in co-relation 26525. Up to 1713 conditions per place. [2022-01-19 00:50:11,778 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 227 selfloop transitions, 133 changer transitions 21/574 dead transitions. [2022-01-19 00:50:11,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 574 transitions, 7322 flow [2022-01-19 00:50:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3398 transitions. [2022-01-19 00:50:11,782 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8505632040050063 [2022-01-19 00:50:11,782 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3398 transitions. [2022-01-19 00:50:11,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3398 transitions. [2022-01-19 00:50:11,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:11,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3398 transitions. [2022-01-19 00:50:11,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.88235294117646) internal successors, (3398), 17 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:11,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:11,787 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:11,787 INFO L186 Difference]: Start difference. First operand has 542 places, 532 transitions, 6059 flow. Second operand 17 states and 3398 transitions. [2022-01-19 00:50:11,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 574 transitions, 7322 flow [2022-01-19 00:50:12,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 574 transitions, 6989 flow, removed 115 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:12,212 INFO L242 Difference]: Finished difference. Result has 559 places, 543 transitions, 6354 flow [2022-01-19 00:50:12,212 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5782, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6354, PETRI_PLACES=559, PETRI_TRANSITIONS=543} [2022-01-19 00:50:12,212 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 345 predicate places. [2022-01-19 00:50:12,212 INFO L470 AbstractCegarLoop]: Abstraction has has 559 places, 543 transitions, 6354 flow [2022-01-19 00:50:12,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:12,213 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:12,213 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:12,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:50:12,213 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash 734348958, now seen corresponding path program 13 times [2022-01-19 00:50:12,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784057228] [2022-01-19 00:50:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:12,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:12,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784057228] [2022-01-19 00:50:12,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784057228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:12,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:12,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:12,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791775478] [2022-01-19 00:50:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:12,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:12,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:12,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:12,279 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:12,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 543 transitions, 6354 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:12,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:12,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:12,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:13,701 INFO L129 PetriNetUnfolder]: 1302/5552 cut-off events. [2022-01-19 00:50:13,701 INFO L130 PetriNetUnfolder]: For 53900/54035 co-relation queries the response was YES. [2022-01-19 00:50:13,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26435 conditions, 5552 events. 1302/5552 cut-off events. For 53900/54035 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 62470 event pairs, 484 based on Foata normal form. 11/5371 useless extension candidates. Maximal degree in co-relation 26273. Up to 1743 conditions per place. [2022-01-19 00:50:13,769 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 246 selfloop transitions, 120 changer transitions 21/580 dead transitions. [2022-01-19 00:50:13,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 580 transitions, 7513 flow [2022-01-19 00:50:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3398 transitions. [2022-01-19 00:50:13,771 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8505632040050063 [2022-01-19 00:50:13,771 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3398 transitions. [2022-01-19 00:50:13,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3398 transitions. [2022-01-19 00:50:13,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:13,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3398 transitions. [2022-01-19 00:50:13,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.88235294117646) internal successors, (3398), 17 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:13,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:13,776 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:13,776 INFO L186 Difference]: Start difference. First operand has 559 places, 543 transitions, 6354 flow. Second operand 17 states and 3398 transitions. [2022-01-19 00:50:13,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 580 transitions, 7513 flow [2022-01-19 00:50:14,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 580 transitions, 7405 flow, removed 54 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:14,136 INFO L242 Difference]: Finished difference. Result has 578 places, 551 transitions, 6735 flow [2022-01-19 00:50:14,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=6252, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6735, PETRI_PLACES=578, PETRI_TRANSITIONS=551} [2022-01-19 00:50:14,137 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 364 predicate places. [2022-01-19 00:50:14,137 INFO L470 AbstractCegarLoop]: Abstraction has has 578 places, 551 transitions, 6735 flow [2022-01-19 00:50:14,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:14,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:14,137 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:14,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:50:14,137 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:14,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1783606368, now seen corresponding path program 14 times [2022-01-19 00:50:14,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:14,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426011457] [2022-01-19 00:50:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:14,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:14,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:14,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426011457] [2022-01-19 00:50:14,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426011457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:14,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:14,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:14,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124063289] [2022-01-19 00:50:14,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:14,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:14,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:14,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:14,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:14,203 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:14,204 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 551 transitions, 6735 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:14,204 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:14,204 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:14,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:15,566 INFO L129 PetriNetUnfolder]: 1337/5656 cut-off events. [2022-01-19 00:50:15,566 INFO L130 PetriNetUnfolder]: For 60508/60643 co-relation queries the response was YES. [2022-01-19 00:50:15,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28020 conditions, 5656 events. 1337/5656 cut-off events. For 60508/60643 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 63732 event pairs, 431 based on Foata normal form. 5/5474 useless extension candidates. Maximal degree in co-relation 27852. Up to 1637 conditions per place. [2022-01-19 00:50:15,638 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 305 selfloop transitions, 103 changer transitions 23/624 dead transitions. [2022-01-19 00:50:15,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 624 transitions, 8744 flow [2022-01-19 00:50:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:50:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:50:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3992 transitions. [2022-01-19 00:50:15,641 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8493617021276596 [2022-01-19 00:50:15,641 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3992 transitions. [2022-01-19 00:50:15,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3992 transitions. [2022-01-19 00:50:15,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:15,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3992 transitions. [2022-01-19 00:50:15,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.6) internal successors, (3992), 20 states have internal predecessors, (3992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,647 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:15,647 INFO L186 Difference]: Start difference. First operand has 578 places, 551 transitions, 6735 flow. Second operand 20 states and 3992 transitions. [2022-01-19 00:50:15,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 624 transitions, 8744 flow [2022-01-19 00:50:16,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 624 transitions, 8592 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:16,065 INFO L242 Difference]: Finished difference. Result has 606 places, 580 transitions, 7611 flow [2022-01-19 00:50:16,066 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=6589, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7611, PETRI_PLACES=606, PETRI_TRANSITIONS=580} [2022-01-19 00:50:16,066 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 392 predicate places. [2022-01-19 00:50:16,066 INFO L470 AbstractCegarLoop]: Abstraction has has 606 places, 580 transitions, 7611 flow [2022-01-19 00:50:16,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:16,066 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:16,067 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:16,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:50:16,067 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 398288424, now seen corresponding path program 15 times [2022-01-19 00:50:16,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:16,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633165247] [2022-01-19 00:50:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:16,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:16,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633165247] [2022-01-19 00:50:16,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633165247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:16,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:16,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:16,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265971440] [2022-01-19 00:50:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:16,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:16,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:16,131 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:16,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 580 transitions, 7611 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:16,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:16,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:16,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:17,810 INFO L129 PetriNetUnfolder]: 1395/6042 cut-off events. [2022-01-19 00:50:17,810 INFO L130 PetriNetUnfolder]: For 75093/75228 co-relation queries the response was YES. [2022-01-19 00:50:17,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30627 conditions, 6042 events. 1395/6042 cut-off events. For 75093/75228 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 70287 event pairs, 440 based on Foata normal form. 5/5867 useless extension candidates. Maximal degree in co-relation 30447. Up to 1657 conditions per place. [2022-01-19 00:50:17,896 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 271 selfloop transitions, 166 changer transitions 23/653 dead transitions. [2022-01-19 00:50:17,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 653 transitions, 9597 flow [2022-01-19 00:50:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:50:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:50:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4383 transitions. [2022-01-19 00:50:17,899 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8477756286266924 [2022-01-19 00:50:17,899 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4383 transitions. [2022-01-19 00:50:17,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4383 transitions. [2022-01-19 00:50:17,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:17,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4383 transitions. [2022-01-19 00:50:17,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 199.22727272727272) internal successors, (4383), 22 states have internal predecessors, (4383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:17,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:17,904 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:17,905 INFO L186 Difference]: Start difference. First operand has 606 places, 580 transitions, 7611 flow. Second operand 22 states and 4383 transitions. [2022-01-19 00:50:17,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 653 transitions, 9597 flow [2022-01-19 00:50:18,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 653 transitions, 9173 flow, removed 212 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:18,567 INFO L242 Difference]: Finished difference. Result has 635 places, 607 transitions, 8320 flow [2022-01-19 00:50:18,567 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=7313, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8320, PETRI_PLACES=635, PETRI_TRANSITIONS=607} [2022-01-19 00:50:18,567 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 421 predicate places. [2022-01-19 00:50:18,567 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 607 transitions, 8320 flow [2022-01-19 00:50:18,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:18,568 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:18,568 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:18,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:50:18,568 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1600072184, now seen corresponding path program 16 times [2022-01-19 00:50:18,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103878199] [2022-01-19 00:50:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:18,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:18,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:18,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103878199] [2022-01-19 00:50:18,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103878199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:18,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:18,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:18,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626804291] [2022-01-19 00:50:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:18,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:18,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:18,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:18,632 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:18,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 607 transitions, 8320 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:18,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:18,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:18,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:20,155 INFO L129 PetriNetUnfolder]: 1430/6211 cut-off events. [2022-01-19 00:50:20,155 INFO L130 PetriNetUnfolder]: For 72589/72724 co-relation queries the response was YES. [2022-01-19 00:50:20,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31775 conditions, 6211 events. 1430/6211 cut-off events. For 72589/72724 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 72840 event pairs, 440 based on Foata normal form. 5/6030 useless extension candidates. Maximal degree in co-relation 31584. Up to 1741 conditions per place. [2022-01-19 00:50:20,411 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 324 selfloop transitions, 129 changer transitions 16/662 dead transitions. [2022-01-19 00:50:20,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 662 transitions, 10162 flow [2022-01-19 00:50:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3397 transitions. [2022-01-19 00:50:20,414 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8503128911138924 [2022-01-19 00:50:20,414 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3397 transitions. [2022-01-19 00:50:20,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3397 transitions. [2022-01-19 00:50:20,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:20,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3397 transitions. [2022-01-19 00:50:20,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.8235294117647) internal successors, (3397), 17 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:20,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:20,419 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:20,419 INFO L186 Difference]: Start difference. First operand has 635 places, 607 transitions, 8320 flow. Second operand 17 states and 3397 transitions. [2022-01-19 00:50:20,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 662 transitions, 10162 flow [2022-01-19 00:50:21,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 662 transitions, 9933 flow, removed 111 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:21,037 INFO L242 Difference]: Finished difference. Result has 654 places, 628 transitions, 9000 flow [2022-01-19 00:50:21,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8131, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9000, PETRI_PLACES=654, PETRI_TRANSITIONS=628} [2022-01-19 00:50:21,038 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 440 predicate places. [2022-01-19 00:50:21,038 INFO L470 AbstractCegarLoop]: Abstraction has has 654 places, 628 transitions, 9000 flow [2022-01-19 00:50:21,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:21,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:21,038 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:21,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:50:21,039 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:21,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1433142104, now seen corresponding path program 17 times [2022-01-19 00:50:21,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:21,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462761655] [2022-01-19 00:50:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:21,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:21,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:21,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462761655] [2022-01-19 00:50:21,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462761655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:21,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:21,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:21,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687442483] [2022-01-19 00:50:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:21,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:21,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:21,135 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:21,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 628 transitions, 9000 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:21,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:21,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:21,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:23,033 INFO L129 PetriNetUnfolder]: 1464/6399 cut-off events. [2022-01-19 00:50:23,033 INFO L130 PetriNetUnfolder]: For 77724/77859 co-relation queries the response was YES. [2022-01-19 00:50:23,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33331 conditions, 6399 events. 1464/6399 cut-off events. For 77724/77859 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 75719 event pairs, 438 based on Foata normal form. 5/6214 useless extension candidates. Maximal degree in co-relation 33134. Up to 1698 conditions per place. [2022-01-19 00:50:23,122 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 341 selfloop transitions, 134 changer transitions 21/689 dead transitions. [2022-01-19 00:50:23,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 689 transitions, 10906 flow [2022-01-19 00:50:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:50:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:50:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4187 transitions. [2022-01-19 00:50:23,125 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8484295845997973 [2022-01-19 00:50:23,125 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4187 transitions. [2022-01-19 00:50:23,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4187 transitions. [2022-01-19 00:50:23,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:23,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4187 transitions. [2022-01-19 00:50:23,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 199.38095238095238) internal successors, (4187), 21 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,130 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,130 INFO L186 Difference]: Start difference. First operand has 654 places, 628 transitions, 9000 flow. Second operand 21 states and 4187 transitions. [2022-01-19 00:50:23,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 672 places, 689 transitions, 10906 flow [2022-01-19 00:50:23,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 689 transitions, 10694 flow, removed 106 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:23,779 INFO L242 Difference]: Finished difference. Result has 681 places, 650 transitions, 9719 flow [2022-01-19 00:50:23,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8792, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=9719, PETRI_PLACES=681, PETRI_TRANSITIONS=650} [2022-01-19 00:50:23,780 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 467 predicate places. [2022-01-19 00:50:23,780 INFO L470 AbstractCegarLoop]: Abstraction has has 681 places, 650 transitions, 9719 flow [2022-01-19 00:50:23,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,781 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:23,781 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:23,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:50:23,781 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2076436690, now seen corresponding path program 18 times [2022-01-19 00:50:23,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926886263] [2022-01-19 00:50:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:23,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:23,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926886263] [2022-01-19 00:50:23,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926886263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:23,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:23,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:23,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494483302] [2022-01-19 00:50:23,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:23,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:23,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:23,843 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:23,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 650 transitions, 9719 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:23,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:23,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:23,844 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:25,736 INFO L129 PetriNetUnfolder]: 1463/6399 cut-off events. [2022-01-19 00:50:25,737 INFO L130 PetriNetUnfolder]: For 79219/79354 co-relation queries the response was YES. [2022-01-19 00:50:25,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33780 conditions, 6399 events. 1463/6399 cut-off events. For 79219/79354 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 75669 event pairs, 443 based on Foata normal form. 5/6223 useless extension candidates. Maximal degree in co-relation 33573. Up to 1797 conditions per place. [2022-01-19 00:50:25,849 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 298 selfloop transitions, 183 changer transitions 23/697 dead transitions. [2022-01-19 00:50:25,849 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 697 transitions, 11251 flow [2022-01-19 00:50:25,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3593 transitions. [2022-01-19 00:50:25,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8494089834515366 [2022-01-19 00:50:25,852 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3593 transitions. [2022-01-19 00:50:25,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3593 transitions. [2022-01-19 00:50:25,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:25,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3593 transitions. [2022-01-19 00:50:25,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.61111111111111) internal successors, (3593), 18 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:25,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:25,857 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:25,858 INFO L186 Difference]: Start difference. First operand has 681 places, 650 transitions, 9719 flow. Second operand 18 states and 3593 transitions. [2022-01-19 00:50:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 697 transitions, 11251 flow [2022-01-19 00:50:26,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 697 transitions, 11030 flow, removed 101 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:26,649 INFO L242 Difference]: Finished difference. Result has 699 places, 660 transitions, 10184 flow [2022-01-19 00:50:26,649 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=9501, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10184, PETRI_PLACES=699, PETRI_TRANSITIONS=660} [2022-01-19 00:50:26,650 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 485 predicate places. [2022-01-19 00:50:26,650 INFO L470 AbstractCegarLoop]: Abstraction has has 699 places, 660 transitions, 10184 flow [2022-01-19 00:50:26,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:26,650 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:26,650 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:26,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:50:26,651 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1184340122, now seen corresponding path program 19 times [2022-01-19 00:50:26,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:26,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850097829] [2022-01-19 00:50:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:26,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:26,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:26,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850097829] [2022-01-19 00:50:26,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850097829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:26,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:26,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:26,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405389063] [2022-01-19 00:50:26,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:26,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:26,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:26,720 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:26,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 660 transitions, 10184 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:26,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:26,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:26,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:28,551 INFO L129 PetriNetUnfolder]: 1468/6515 cut-off events. [2022-01-19 00:50:28,551 INFO L130 PetriNetUnfolder]: For 78728/78863 co-relation queries the response was YES. [2022-01-19 00:50:28,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34514 conditions, 6515 events. 1468/6515 cut-off events. For 78728/78863 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 77900 event pairs, 455 based on Foata normal form. 5/6327 useless extension candidates. Maximal degree in co-relation 34303. Up to 1818 conditions per place. [2022-01-19 00:50:28,647 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 354 selfloop transitions, 135 changer transitions 21/703 dead transitions. [2022-01-19 00:50:28,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 703 transitions, 11747 flow [2022-01-19 00:50:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3596 transitions. [2022-01-19 00:50:28,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8501182033096927 [2022-01-19 00:50:28,649 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3596 transitions. [2022-01-19 00:50:28,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3596 transitions. [2022-01-19 00:50:28,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:28,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3596 transitions. [2022-01-19 00:50:28,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.77777777777777) internal successors, (3596), 18 states have internal predecessors, (3596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:28,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:28,653 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:28,653 INFO L186 Difference]: Start difference. First operand has 699 places, 660 transitions, 10184 flow. Second operand 18 states and 3596 transitions. [2022-01-19 00:50:28,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 703 transitions, 11747 flow [2022-01-19 00:50:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 703 transitions, 11413 flow, removed 85 selfloop flow, removed 6 redundant places. [2022-01-19 00:50:29,363 INFO L242 Difference]: Finished difference. Result has 715 places, 672 transitions, 10509 flow [2022-01-19 00:50:29,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=9866, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10509, PETRI_PLACES=715, PETRI_TRANSITIONS=672} [2022-01-19 00:50:29,367 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 501 predicate places. [2022-01-19 00:50:29,367 INFO L470 AbstractCegarLoop]: Abstraction has has 715 places, 672 transitions, 10509 flow [2022-01-19 00:50:29,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:29,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:29,367 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:29,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:50:29,368 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash -885340956, now seen corresponding path program 20 times [2022-01-19 00:50:29,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:29,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939355668] [2022-01-19 00:50:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:29,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:29,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:29,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939355668] [2022-01-19 00:50:29,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939355668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:29,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:29,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:29,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161506399] [2022-01-19 00:50:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:29,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:29,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:29,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:29,439 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:29,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 672 transitions, 10509 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:29,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:29,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:29,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:31,368 INFO L129 PetriNetUnfolder]: 1468/6545 cut-off events. [2022-01-19 00:50:31,368 INFO L130 PetriNetUnfolder]: For 78867/79002 co-relation queries the response was YES. [2022-01-19 00:50:31,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34634 conditions, 6545 events. 1468/6545 cut-off events. For 78867/79002 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 78264 event pairs, 454 based on Foata normal form. 5/6360 useless extension candidates. Maximal degree in co-relation 34424. Up to 1828 conditions per place. [2022-01-19 00:50:31,462 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 36 selfloop transitions, 2 changer transitions 494/712 dead transitions. [2022-01-19 00:50:31,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 712 transitions, 11961 flow [2022-01-19 00:50:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3596 transitions. [2022-01-19 00:50:31,466 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8501182033096927 [2022-01-19 00:50:31,466 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3596 transitions. [2022-01-19 00:50:31,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3596 transitions. [2022-01-19 00:50:31,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:31,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3596 transitions. [2022-01-19 00:50:31,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.77777777777777) internal successors, (3596), 18 states have internal predecessors, (3596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:31,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:31,471 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:31,471 INFO L186 Difference]: Start difference. First operand has 715 places, 672 transitions, 10509 flow. Second operand 18 states and 3596 transitions. [2022-01-19 00:50:31,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 712 transitions, 11961 flow [2022-01-19 00:50:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 712 transitions, 11827 flow, removed 67 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:32,310 INFO L242 Difference]: Finished difference. Result has 733 places, 215 transitions, 824 flow [2022-01-19 00:50:32,311 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=10377, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=824, PETRI_PLACES=733, PETRI_TRANSITIONS=215} [2022-01-19 00:50:32,311 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 519 predicate places. [2022-01-19 00:50:32,311 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 215 transitions, 824 flow [2022-01-19 00:50:32,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,312 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:32,312 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:32,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:50:32,312 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1811191079, now seen corresponding path program 1 times [2022-01-19 00:50:32,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:32,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518209161] [2022-01-19 00:50:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:32,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:32,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518209161] [2022-01-19 00:50:32,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518209161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:32,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:32,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:32,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136172288] [2022-01-19 00:50:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:32,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:32,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:32,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:32,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 215 transitions, 824 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:32,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:32,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:32,908 INFO L129 PetriNetUnfolder]: 478/1996 cut-off events. [2022-01-19 00:50:32,908 INFO L130 PetriNetUnfolder]: For 15863/16026 co-relation queries the response was YES. [2022-01-19 00:50:32,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6895 conditions, 1996 events. 478/1996 cut-off events. For 15863/16026 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15552 event pairs, 222 based on Foata normal form. 1/1879 useless extension candidates. Maximal degree in co-relation 6691. Up to 503 conditions per place. [2022-01-19 00:50:32,943 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 90 selfloop transitions, 30 changer transitions 28/329 dead transitions. [2022-01-19 00:50:32,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 329 transitions, 1847 flow [2022-01-19 00:50:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:50:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:50:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4790 transitions. [2022-01-19 00:50:32,946 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849290780141844 [2022-01-19 00:50:32,946 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4790 transitions. [2022-01-19 00:50:32,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4790 transitions. [2022-01-19 00:50:32,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:32,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4790 transitions. [2022-01-19 00:50:32,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 199.58333333333334) internal successors, (4790), 24 states have internal predecessors, (4790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,952 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,952 INFO L186 Difference]: Start difference. First operand has 733 places, 215 transitions, 824 flow. Second operand 24 states and 4790 transitions. [2022-01-19 00:50:32,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 329 transitions, 1847 flow [2022-01-19 00:50:32,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 329 transitions, 1341 flow, removed 227 selfloop flow, removed 98 redundant places. [2022-01-19 00:50:32,987 INFO L242 Difference]: Finished difference. Result has 371 places, 244 transitions, 875 flow [2022-01-19 00:50:32,987 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=875, PETRI_PLACES=371, PETRI_TRANSITIONS=244} [2022-01-19 00:50:32,987 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 157 predicate places. [2022-01-19 00:50:32,987 INFO L470 AbstractCegarLoop]: Abstraction has has 371 places, 244 transitions, 875 flow [2022-01-19 00:50:32,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:32,988 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:32,988 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:32,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:50:32,988 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:32,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash 514473643, now seen corresponding path program 2 times [2022-01-19 00:50:32,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:32,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650344423] [2022-01-19 00:50:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:32,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:33,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650344423] [2022-01-19 00:50:33,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650344423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:33,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:33,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:33,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776640959] [2022-01-19 00:50:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:33,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:33,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:33,063 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:33,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 244 transitions, 875 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:33,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:33,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:33,613 INFO L129 PetriNetUnfolder]: 599/2347 cut-off events. [2022-01-19 00:50:33,614 INFO L130 PetriNetUnfolder]: For 6398/6536 co-relation queries the response was YES. [2022-01-19 00:50:33,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7560 conditions, 2347 events. 599/2347 cut-off events. For 6398/6536 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 19252 event pairs, 296 based on Foata normal form. 1/2177 useless extension candidates. Maximal degree in co-relation 7422. Up to 667 conditions per place. [2022-01-19 00:50:33,644 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 74 selfloop transitions, 45 changer transitions 19/319 dead transitions. [2022-01-19 00:50:33,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 319 transitions, 1644 flow [2022-01-19 00:50:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:50:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:50:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3987 transitions. [2022-01-19 00:50:33,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482978723404255 [2022-01-19 00:50:33,646 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3987 transitions. [2022-01-19 00:50:33,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3987 transitions. [2022-01-19 00:50:33,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:33,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3987 transitions. [2022-01-19 00:50:33,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.35) internal successors, (3987), 20 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,651 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,651 INFO L186 Difference]: Start difference. First operand has 371 places, 244 transitions, 875 flow. Second operand 20 states and 3987 transitions. [2022-01-19 00:50:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 319 transitions, 1644 flow [2022-01-19 00:50:33,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 319 transitions, 1588 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:33,675 INFO L242 Difference]: Finished difference. Result has 400 places, 276 transitions, 1294 flow [2022-01-19 00:50:33,675 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1294, PETRI_PLACES=400, PETRI_TRANSITIONS=276} [2022-01-19 00:50:33,675 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 186 predicate places. [2022-01-19 00:50:33,676 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 276 transitions, 1294 flow [2022-01-19 00:50:33,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,676 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:33,676 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:33,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:50:33,676 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1317230745, now seen corresponding path program 3 times [2022-01-19 00:50:33,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:33,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541352016] [2022-01-19 00:50:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:33,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:33,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:33,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541352016] [2022-01-19 00:50:33,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541352016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:33,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:33,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:33,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749283988] [2022-01-19 00:50:33,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:33,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:33,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:33,746 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:33,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 276 transitions, 1294 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:33,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:33,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:33,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:34,296 INFO L129 PetriNetUnfolder]: 645/2490 cut-off events. [2022-01-19 00:50:34,296 INFO L130 PetriNetUnfolder]: For 11790/11838 co-relation queries the response was YES. [2022-01-19 00:50:34,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9601 conditions, 2490 events. 645/2490 cut-off events. For 11790/11838 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21478 event pairs, 308 based on Foata normal form. 9/2308 useless extension candidates. Maximal degree in co-relation 9450. Up to 755 conditions per place. [2022-01-19 00:50:34,335 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 109 selfloop transitions, 42 changer transitions 22/354 dead transitions. [2022-01-19 00:50:34,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 354 transitions, 2363 flow [2022-01-19 00:50:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:50:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:50:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3990 transitions. [2022-01-19 00:50:34,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8489361702127659 [2022-01-19 00:50:34,337 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3990 transitions. [2022-01-19 00:50:34,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3990 transitions. [2022-01-19 00:50:34,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:34,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3990 transitions. [2022-01-19 00:50:34,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.5) internal successors, (3990), 20 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:34,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:34,342 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 235.0) internal successors, (4935), 21 states have internal predecessors, (4935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:34,342 INFO L186 Difference]: Start difference. First operand has 400 places, 276 transitions, 1294 flow. Second operand 20 states and 3990 transitions. [2022-01-19 00:50:34,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 354 transitions, 2363 flow [2022-01-19 00:50:34,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 354 transitions, 2085 flow, removed 139 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:34,407 INFO L242 Difference]: Finished difference. Result has 430 places, 308 transitions, 1657 flow [2022-01-19 00:50:34,408 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1657, PETRI_PLACES=430, PETRI_TRANSITIONS=308} [2022-01-19 00:50:34,408 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 216 predicate places. [2022-01-19 00:50:34,408 INFO L470 AbstractCegarLoop]: Abstraction has has 430 places, 308 transitions, 1657 flow [2022-01-19 00:50:34,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:34,409 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:34,409 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:34,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:50:34,409 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1416168871, now seen corresponding path program 4 times [2022-01-19 00:50:34,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:34,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720657331] [2022-01-19 00:50:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:34,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:34,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:34,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720657331] [2022-01-19 00:50:34,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720657331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:34,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:34,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:34,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611246580] [2022-01-19 00:50:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:34,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:34,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:34,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:34,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:34,499 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:34,500 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 308 transitions, 1657 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:34,500 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:34,500 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:34,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:35,135 INFO L129 PetriNetUnfolder]: 693/2824 cut-off events. [2022-01-19 00:50:35,135 INFO L130 PetriNetUnfolder]: For 13920/13978 co-relation queries the response was YES. [2022-01-19 00:50:35,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10774 conditions, 2824 events. 693/2824 cut-off events. For 13920/13978 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 25503 event pairs, 278 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 10609. Up to 580 conditions per place. [2022-01-19 00:50:35,179 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 124 selfloop transitions, 76 changer transitions 26/407 dead transitions. [2022-01-19 00:50:35,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 407 transitions, 3034 flow [2022-01-19 00:50:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:50:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:50:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4782 transitions. [2022-01-19 00:50:35,182 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847872340425532 [2022-01-19 00:50:35,182 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4782 transitions. [2022-01-19 00:50:35,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4782 transitions. [2022-01-19 00:50:35,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:35,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4782 transitions. [2022-01-19 00:50:35,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 199.25) internal successors, (4782), 24 states have internal predecessors, (4782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:35,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:35,187 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 235.0) internal successors, (5875), 25 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:35,187 INFO L186 Difference]: Start difference. First operand has 430 places, 308 transitions, 1657 flow. Second operand 24 states and 4782 transitions. [2022-01-19 00:50:35,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 407 transitions, 3034 flow [2022-01-19 00:50:35,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 407 transitions, 2750 flow, removed 142 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:35,259 INFO L242 Difference]: Finished difference. Result has 469 places, 336 transitions, 2166 flow [2022-01-19 00:50:35,259 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2166, PETRI_PLACES=469, PETRI_TRANSITIONS=336} [2022-01-19 00:50:35,260 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 255 predicate places. [2022-01-19 00:50:35,260 INFO L470 AbstractCegarLoop]: Abstraction has has 469 places, 336 transitions, 2166 flow [2022-01-19 00:50:35,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:35,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:35,260 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:35,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:50:35,260 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash 952413203, now seen corresponding path program 5 times [2022-01-19 00:50:35,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:35,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045502277] [2022-01-19 00:50:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:35,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:35,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:35,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045502277] [2022-01-19 00:50:35,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045502277] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:35,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:35,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:35,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710131586] [2022-01-19 00:50:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:35,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:35,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:35,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:35,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:35,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 336 transitions, 2166 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:35,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:35,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:35,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:36,124 INFO L129 PetriNetUnfolder]: 808/3121 cut-off events. [2022-01-19 00:50:36,124 INFO L130 PetriNetUnfolder]: For 20324/20531 co-relation queries the response was YES. [2022-01-19 00:50:36,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13456 conditions, 3121 events. 808/3121 cut-off events. For 20324/20531 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 28580 event pairs, 320 based on Foata normal form. 12/2897 useless extension candidates. Maximal degree in co-relation 13272. Up to 805 conditions per place. [2022-01-19 00:50:36,179 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 134 selfloop transitions, 86 changer transitions 24/425 dead transitions. [2022-01-19 00:50:36,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 425 transitions, 3566 flow [2022-01-19 00:50:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:50:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:50:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4384 transitions. [2022-01-19 00:50:36,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8479690522243714 [2022-01-19 00:50:36,182 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4384 transitions. [2022-01-19 00:50:36,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4384 transitions. [2022-01-19 00:50:36,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:36,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4384 transitions. [2022-01-19 00:50:36,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 199.27272727272728) internal successors, (4384), 22 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,187 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,187 INFO L186 Difference]: Start difference. First operand has 469 places, 336 transitions, 2166 flow. Second operand 22 states and 4384 transitions. [2022-01-19 00:50:36,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 425 transitions, 3566 flow [2022-01-19 00:50:36,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 425 transitions, 3414 flow, removed 76 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:36,313 INFO L242 Difference]: Finished difference. Result has 500 places, 368 transitions, 2772 flow [2022-01-19 00:50:36,314 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2772, PETRI_PLACES=500, PETRI_TRANSITIONS=368} [2022-01-19 00:50:36,314 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 286 predicate places. [2022-01-19 00:50:36,314 INFO L470 AbstractCegarLoop]: Abstraction has has 500 places, 368 transitions, 2772 flow [2022-01-19 00:50:36,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,314 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:36,314 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:36,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 00:50:36,315 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -274068485, now seen corresponding path program 6 times [2022-01-19 00:50:36,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:36,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683497379] [2022-01-19 00:50:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:36,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:36,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683497379] [2022-01-19 00:50:36,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683497379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:36,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:36,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:36,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746981977] [2022-01-19 00:50:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:36,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:36,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:36,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:36,397 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:36,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 368 transitions, 2772 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:36,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:36,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:36,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:37,269 INFO L129 PetriNetUnfolder]: 867/3446 cut-off events. [2022-01-19 00:50:37,270 INFO L130 PetriNetUnfolder]: For 26147/26385 co-relation queries the response was YES. [2022-01-19 00:50:37,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15406 conditions, 3446 events. 867/3446 cut-off events. For 26147/26385 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 32703 event pairs, 378 based on Foata normal form. 1/3178 useless extension candidates. Maximal degree in co-relation 15209. Up to 887 conditions per place. [2022-01-19 00:50:37,332 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 143 selfloop transitions, 89 changer transitions 16/429 dead transitions. [2022-01-19 00:50:37,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 429 transitions, 3960 flow [2022-01-19 00:50:37,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3397 transitions. [2022-01-19 00:50:37,334 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8503128911138924 [2022-01-19 00:50:37,334 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3397 transitions. [2022-01-19 00:50:37,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3397 transitions. [2022-01-19 00:50:37,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:37,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3397 transitions. [2022-01-19 00:50:37,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.8235294117647) internal successors, (3397), 17 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:37,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:37,338 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:37,339 INFO L186 Difference]: Start difference. First operand has 500 places, 368 transitions, 2772 flow. Second operand 17 states and 3397 transitions. [2022-01-19 00:50:37,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 429 transitions, 3960 flow [2022-01-19 00:50:37,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 429 transitions, 3786 flow, removed 87 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:37,526 INFO L242 Difference]: Finished difference. Result has 521 places, 389 transitions, 3230 flow [2022-01-19 00:50:37,526 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2624, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3230, PETRI_PLACES=521, PETRI_TRANSITIONS=389} [2022-01-19 00:50:37,527 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 307 predicate places. [2022-01-19 00:50:37,527 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 389 transitions, 3230 flow [2022-01-19 00:50:37,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:37,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:37,527 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:37,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 00:50:37,527 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:37,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -100150973, now seen corresponding path program 7 times [2022-01-19 00:50:37,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:37,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566885094] [2022-01-19 00:50:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:37,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:37,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:37,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566885094] [2022-01-19 00:50:37,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566885094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:37,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:37,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:37,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011888560] [2022-01-19 00:50:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:37,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:37,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:37,591 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:37,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 389 transitions, 3230 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:37,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:37,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:37,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:38,498 INFO L129 PetriNetUnfolder]: 901/3582 cut-off events. [2022-01-19 00:50:38,498 INFO L130 PetriNetUnfolder]: For 29921/30179 co-relation queries the response was YES. [2022-01-19 00:50:38,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16634 conditions, 3582 events. 901/3582 cut-off events. For 29921/30179 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 34390 event pairs, 335 based on Foata normal form. 18/3326 useless extension candidates. Maximal degree in co-relation 16429. Up to 943 conditions per place. [2022-01-19 00:50:38,564 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 151 selfloop transitions, 104 changer transitions 14/450 dead transitions. [2022-01-19 00:50:38,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 450 transitions, 4433 flow [2022-01-19 00:50:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:50:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:50:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3197 transitions. [2022-01-19 00:50:38,566 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8502659574468086 [2022-01-19 00:50:38,566 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3197 transitions. [2022-01-19 00:50:38,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3197 transitions. [2022-01-19 00:50:38,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:38,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3197 transitions. [2022-01-19 00:50:38,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 199.8125) internal successors, (3197), 16 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:38,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:38,570 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:38,570 INFO L186 Difference]: Start difference. First operand has 521 places, 389 transitions, 3230 flow. Second operand 16 states and 3197 transitions. [2022-01-19 00:50:38,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 450 transitions, 4433 flow [2022-01-19 00:50:38,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 450 transitions, 4295 flow, removed 69 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:38,779 INFO L242 Difference]: Finished difference. Result has 541 places, 407 transitions, 3668 flow [2022-01-19 00:50:38,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3668, PETRI_PLACES=541, PETRI_TRANSITIONS=407} [2022-01-19 00:50:38,780 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 327 predicate places. [2022-01-19 00:50:38,780 INFO L470 AbstractCegarLoop]: Abstraction has has 541 places, 407 transitions, 3668 flow [2022-01-19 00:50:38,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:38,780 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:38,781 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:38,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 00:50:38,781 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1816775041, now seen corresponding path program 8 times [2022-01-19 00:50:38,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:38,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795195591] [2022-01-19 00:50:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:38,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:38,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:38,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795195591] [2022-01-19 00:50:38,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795195591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:38,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:38,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:38,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124776729] [2022-01-19 00:50:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:38,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:38,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:38,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:38,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 407 transitions, 3668 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:38,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:38,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:38,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:39,965 INFO L129 PetriNetUnfolder]: 933/3772 cut-off events. [2022-01-19 00:50:39,965 INFO L130 PetriNetUnfolder]: For 35937/36196 co-relation queries the response was YES. [2022-01-19 00:50:40,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18144 conditions, 3772 events. 933/3772 cut-off events. For 35937/36196 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36743 event pairs, 365 based on Foata normal form. 1/3487 useless extension candidates. Maximal degree in co-relation 17931. Up to 881 conditions per place. [2022-01-19 00:50:40,037 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 175 selfloop transitions, 98 changer transitions 23/477 dead transitions. [2022-01-19 00:50:40,037 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 477 transitions, 5177 flow [2022-01-19 00:50:40,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:50:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:50:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4189 transitions. [2022-01-19 00:50:40,039 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8488348530901723 [2022-01-19 00:50:40,039 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4189 transitions. [2022-01-19 00:50:40,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4189 transitions. [2022-01-19 00:50:40,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:40,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4189 transitions. [2022-01-19 00:50:40,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 199.47619047619048) internal successors, (4189), 21 states have internal predecessors, (4189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:40,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:40,044 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:40,044 INFO L186 Difference]: Start difference. First operand has 541 places, 407 transitions, 3668 flow. Second operand 21 states and 4189 transitions. [2022-01-19 00:50:40,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 477 transitions, 5177 flow [2022-01-19 00:50:40,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 477 transitions, 5013 flow, removed 60 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:40,290 INFO L242 Difference]: Finished difference. Result has 570 places, 431 transitions, 4350 flow [2022-01-19 00:50:40,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4350, PETRI_PLACES=570, PETRI_TRANSITIONS=431} [2022-01-19 00:50:40,290 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 356 predicate places. [2022-01-19 00:50:40,290 INFO L470 AbstractCegarLoop]: Abstraction has has 570 places, 431 transitions, 4350 flow [2022-01-19 00:50:40,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:40,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:40,291 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:40,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 00:50:40,291 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1050296499, now seen corresponding path program 9 times [2022-01-19 00:50:40,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:40,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53620876] [2022-01-19 00:50:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:40,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:40,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:40,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53620876] [2022-01-19 00:50:40,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53620876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:40,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:40,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:40,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913781326] [2022-01-19 00:50:40,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:40,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:40,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:40,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:40,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:40,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:40,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 431 transitions, 4350 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:40,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:40,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:40,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:41,440 INFO L129 PetriNetUnfolder]: 945/3798 cut-off events. [2022-01-19 00:50:41,440 INFO L130 PetriNetUnfolder]: For 39400/39482 co-relation queries the response was YES. [2022-01-19 00:50:41,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18944 conditions, 3798 events. 945/3798 cut-off events. For 39400/39482 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 37299 event pairs, 321 based on Foata normal form. 31/3541 useless extension candidates. Maximal degree in co-relation 18719. Up to 981 conditions per place. [2022-01-19 00:50:41,522 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 164 selfloop transitions, 117 changer transitions 23/485 dead transitions. [2022-01-19 00:50:41,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 485 transitions, 5548 flow [2022-01-19 00:50:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3592 transitions. [2022-01-19 00:50:41,524 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8491725768321513 [2022-01-19 00:50:41,525 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3592 transitions. [2022-01-19 00:50:41,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3592 transitions. [2022-01-19 00:50:41,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:41,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3592 transitions. [2022-01-19 00:50:41,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.55555555555554) internal successors, (3592), 18 states have internal predecessors, (3592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,529 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,529 INFO L186 Difference]: Start difference. First operand has 570 places, 431 transitions, 4350 flow. Second operand 18 states and 3592 transitions. [2022-01-19 00:50:41,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 485 transitions, 5548 flow [2022-01-19 00:50:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 485 transitions, 5338 flow, removed 105 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:41,840 INFO L242 Difference]: Finished difference. Result has 591 places, 441 transitions, 4661 flow [2022-01-19 00:50:41,841 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4661, PETRI_PLACES=591, PETRI_TRANSITIONS=441} [2022-01-19 00:50:41,841 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 377 predicate places. [2022-01-19 00:50:41,841 INFO L470 AbstractCegarLoop]: Abstraction has has 591 places, 441 transitions, 4661 flow [2022-01-19 00:50:41,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,842 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:41,842 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:41,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 00:50:41,842 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -881983625, now seen corresponding path program 10 times [2022-01-19 00:50:41,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:41,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515087711] [2022-01-19 00:50:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:41,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:41,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:41,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515087711] [2022-01-19 00:50:41,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515087711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:41,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:41,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:41,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121950191] [2022-01-19 00:50:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:41,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:41,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:41,911 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:41,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 441 transitions, 4661 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:41,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:41,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:41,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:43,090 INFO L129 PetriNetUnfolder]: 971/4050 cut-off events. [2022-01-19 00:50:43,091 INFO L130 PetriNetUnfolder]: For 42897/42971 co-relation queries the response was YES. [2022-01-19 00:50:43,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20138 conditions, 4050 events. 971/4050 cut-off events. For 42897/42971 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 40768 event pairs, 350 based on Foata normal form. 14/3760 useless extension candidates. Maximal degree in co-relation 19906. Up to 1031 conditions per place. [2022-01-19 00:50:43,178 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 192 selfloop transitions, 107 changer transitions 15/495 dead transitions. [2022-01-19 00:50:43,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 495 transitions, 6016 flow [2022-01-19 00:50:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3397 transitions. [2022-01-19 00:50:43,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8503128911138924 [2022-01-19 00:50:43,181 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3397 transitions. [2022-01-19 00:50:43,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3397 transitions. [2022-01-19 00:50:43,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:43,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3397 transitions. [2022-01-19 00:50:43,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.8235294117647) internal successors, (3397), 17 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:43,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:43,185 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:43,185 INFO L186 Difference]: Start difference. First operand has 591 places, 441 transitions, 4661 flow. Second operand 17 states and 3397 transitions. [2022-01-19 00:50:43,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 495 transitions, 6016 flow [2022-01-19 00:50:43,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 495 transitions, 5828 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:43,540 INFO L242 Difference]: Finished difference. Result has 610 places, 462 transitions, 5225 flow [2022-01-19 00:50:43,541 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5225, PETRI_PLACES=610, PETRI_TRANSITIONS=462} [2022-01-19 00:50:43,541 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 396 predicate places. [2022-01-19 00:50:43,541 INFO L470 AbstractCegarLoop]: Abstraction has has 610 places, 462 transitions, 5225 flow [2022-01-19 00:50:43,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:43,542 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:43,542 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:43,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 00:50:43,542 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash 511984547, now seen corresponding path program 11 times [2022-01-19 00:50:43,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:43,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296147549] [2022-01-19 00:50:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:43,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:43,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:43,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296147549] [2022-01-19 00:50:43,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296147549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:43,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:43,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:43,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096662205] [2022-01-19 00:50:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:43,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:43,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:43,612 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:43,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 462 transitions, 5225 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:43,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:43,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:43,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:44,935 INFO L129 PetriNetUnfolder]: 968/4066 cut-off events. [2022-01-19 00:50:44,935 INFO L130 PetriNetUnfolder]: For 44127/44207 co-relation queries the response was YES. [2022-01-19 00:50:45,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20728 conditions, 4066 events. 968/4066 cut-off events. For 44127/44207 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 41172 event pairs, 339 based on Foata normal form. 14/3769 useless extension candidates. Maximal degree in co-relation 20488. Up to 1053 conditions per place. [2022-01-19 00:50:45,026 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 177 selfloop transitions, 127 changer transitions 20/505 dead transitions. [2022-01-19 00:50:45,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 505 transitions, 6336 flow [2022-01-19 00:50:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3592 transitions. [2022-01-19 00:50:45,028 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8491725768321513 [2022-01-19 00:50:45,028 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3592 transitions. [2022-01-19 00:50:45,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3592 transitions. [2022-01-19 00:50:45,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:45,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3592 transitions. [2022-01-19 00:50:45,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.55555555555554) internal successors, (3592), 18 states have internal predecessors, (3592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:45,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:45,033 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:45,033 INFO L186 Difference]: Start difference. First operand has 610 places, 462 transitions, 5225 flow. Second operand 18 states and 3592 transitions. [2022-01-19 00:50:45,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 505 transitions, 6336 flow [2022-01-19 00:50:45,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 505 transitions, 6134 flow, removed 76 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:45,418 INFO L242 Difference]: Finished difference. Result has 629 places, 474 transitions, 5599 flow [2022-01-19 00:50:45,419 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5029, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5599, PETRI_PLACES=629, PETRI_TRANSITIONS=474} [2022-01-19 00:50:45,419 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 415 predicate places. [2022-01-19 00:50:45,419 INFO L470 AbstractCegarLoop]: Abstraction has has 629 places, 474 transitions, 5599 flow [2022-01-19 00:50:45,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:45,419 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:45,420 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:45,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 00:50:45,420 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1353104711, now seen corresponding path program 12 times [2022-01-19 00:50:45,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:45,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101870730] [2022-01-19 00:50:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:45,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:45,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:45,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101870730] [2022-01-19 00:50:45,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101870730] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:45,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:45,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:45,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563020459] [2022-01-19 00:50:45,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:45,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:45,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:45,489 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:45,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 474 transitions, 5599 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:45,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:45,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:45,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:46,873 INFO L129 PetriNetUnfolder]: 968/4185 cut-off events. [2022-01-19 00:50:46,874 INFO L130 PetriNetUnfolder]: For 46486/46566 co-relation queries the response was YES. [2022-01-19 00:50:46,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21052 conditions, 4185 events. 968/4185 cut-off events. For 46486/46566 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 43120 event pairs, 333 based on Foata normal form. 14/3890 useless extension candidates. Maximal degree in co-relation 20807. Up to 1043 conditions per place. [2022-01-19 00:50:46,974 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 195 selfloop transitions, 116 changer transitions 24/516 dead transitions. [2022-01-19 00:50:46,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 516 transitions, 6697 flow [2022-01-19 00:50:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3596 transitions. [2022-01-19 00:50:46,977 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8501182033096927 [2022-01-19 00:50:46,977 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3596 transitions. [2022-01-19 00:50:46,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3596 transitions. [2022-01-19 00:50:46,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:46,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3596 transitions. [2022-01-19 00:50:46,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.77777777777777) internal successors, (3596), 18 states have internal predecessors, (3596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:46,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:46,981 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:46,981 INFO L186 Difference]: Start difference. First operand has 629 places, 474 transitions, 5599 flow. Second operand 18 states and 3596 transitions. [2022-01-19 00:50:46,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 644 places, 516 transitions, 6697 flow [2022-01-19 00:50:47,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 516 transitions, 6536 flow, removed 54 selfloop flow, removed 4 redundant places. [2022-01-19 00:50:47,370 INFO L242 Difference]: Finished difference. Result has 647 places, 483 transitions, 5953 flow [2022-01-19 00:50:47,370 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5446, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5953, PETRI_PLACES=647, PETRI_TRANSITIONS=483} [2022-01-19 00:50:47,371 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 433 predicate places. [2022-01-19 00:50:47,371 INFO L470 AbstractCegarLoop]: Abstraction has has 647 places, 483 transitions, 5953 flow [2022-01-19 00:50:47,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:47,371 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:47,371 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:47,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 00:50:47,371 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash 813993955, now seen corresponding path program 13 times [2022-01-19 00:50:47,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:47,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235175171] [2022-01-19 00:50:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:47,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:47,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:47,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235175171] [2022-01-19 00:50:47,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235175171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:47,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:47,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:47,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325189304] [2022-01-19 00:50:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:47,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:47,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:47,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:47,450 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:47,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 483 transitions, 5953 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:47,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:47,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:47,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:48,894 INFO L129 PetriNetUnfolder]: 1069/4623 cut-off events. [2022-01-19 00:50:48,894 INFO L130 PetriNetUnfolder]: For 58439/58523 co-relation queries the response was YES. [2022-01-19 00:50:48,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23515 conditions, 4623 events. 1069/4623 cut-off events. For 58439/58523 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 48745 event pairs, 353 based on Foata normal form. 1/4302 useless extension candidates. Maximal degree in co-relation 23266. Up to 1077 conditions per place. [2022-01-19 00:50:48,980 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 210 selfloop transitions, 144 changer transitions 23/558 dead transitions. [2022-01-19 00:50:48,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 558 transitions, 7680 flow [2022-01-19 00:50:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:50:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:50:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4380 transitions. [2022-01-19 00:50:48,983 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8471953578336557 [2022-01-19 00:50:48,983 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4380 transitions. [2022-01-19 00:50:48,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4380 transitions. [2022-01-19 00:50:48,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:48,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4380 transitions. [2022-01-19 00:50:48,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 199.0909090909091) internal successors, (4380), 22 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:48,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:48,988 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 235.0) internal successors, (5405), 23 states have internal predecessors, (5405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:48,988 INFO L186 Difference]: Start difference. First operand has 647 places, 483 transitions, 5953 flow. Second operand 22 states and 4380 transitions. [2022-01-19 00:50:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 558 transitions, 7680 flow [2022-01-19 00:50:49,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 558 transitions, 7551 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:49,374 INFO L242 Difference]: Finished difference. Result has 677 places, 515 transitions, 6892 flow [2022-01-19 00:50:49,375 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5826, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6892, PETRI_PLACES=677, PETRI_TRANSITIONS=515} [2022-01-19 00:50:49,375 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 463 predicate places. [2022-01-19 00:50:49,375 INFO L470 AbstractCegarLoop]: Abstraction has has 677 places, 515 transitions, 6892 flow [2022-01-19 00:50:49,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:49,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:49,376 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:49,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 00:50:49,376 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -725621337, now seen corresponding path program 14 times [2022-01-19 00:50:49,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:49,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281585038] [2022-01-19 00:50:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:49,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:49,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281585038] [2022-01-19 00:50:49,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281585038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:49,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:49,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:49,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238191567] [2022-01-19 00:50:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:49,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:49,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:49,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:49,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 515 transitions, 6892 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:49,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:49,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:49,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:50,932 INFO L129 PetriNetUnfolder]: 1100/4726 cut-off events. [2022-01-19 00:50:50,932 INFO L130 PetriNetUnfolder]: For 66967/67043 co-relation queries the response was YES. [2022-01-19 00:50:51,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25378 conditions, 4726 events. 1100/4726 cut-off events. For 66967/67043 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 50187 event pairs, 413 based on Foata normal form. 1/4382 useless extension candidates. Maximal degree in co-relation 25117. Up to 1097 conditions per place. [2022-01-19 00:50:51,025 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 269 selfloop transitions, 106 changer transitions 21/577 dead transitions. [2022-01-19 00:50:51,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 577 transitions, 8570 flow [2022-01-19 00:50:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:50:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:50:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4185 transitions. [2022-01-19 00:50:51,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8480243161094225 [2022-01-19 00:50:51,027 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4185 transitions. [2022-01-19 00:50:51,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4185 transitions. [2022-01-19 00:50:51,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:51,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4185 transitions. [2022-01-19 00:50:51,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 199.28571428571428) internal successors, (4185), 21 states have internal predecessors, (4185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:51,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:51,032 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 235.0) internal successors, (5170), 22 states have internal predecessors, (5170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:51,032 INFO L186 Difference]: Start difference. First operand has 677 places, 515 transitions, 6892 flow. Second operand 21 states and 4185 transitions. [2022-01-19 00:50:51,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 577 transitions, 8570 flow [2022-01-19 00:50:51,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 577 transitions, 8370 flow, removed 100 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:51,487 INFO L242 Difference]: Finished difference. Result has 707 places, 539 transitions, 7573 flow [2022-01-19 00:50:51,488 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=6706, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7573, PETRI_PLACES=707, PETRI_TRANSITIONS=539} [2022-01-19 00:50:51,488 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 493 predicate places. [2022-01-19 00:50:51,488 INFO L470 AbstractCegarLoop]: Abstraction has has 707 places, 539 transitions, 7573 flow [2022-01-19 00:50:51,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:51,488 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:51,488 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:51,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 00:50:51,489 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash 259375591, now seen corresponding path program 15 times [2022-01-19 00:50:51,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:51,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979396535] [2022-01-19 00:50:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:51,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:51,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:51,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979396535] [2022-01-19 00:50:51,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979396535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:51,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:51,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:51,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244238825] [2022-01-19 00:50:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:51,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:51,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:51,569 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:51,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 539 transitions, 7573 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:51,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:51,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:51,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:53,273 INFO L129 PetriNetUnfolder]: 1123/4903 cut-off events. [2022-01-19 00:50:53,273 INFO L130 PetriNetUnfolder]: For 72565/72641 co-relation queries the response was YES. [2022-01-19 00:50:53,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26617 conditions, 4903 events. 1123/4903 cut-off events. For 72565/72641 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 52780 event pairs, 351 based on Foata normal form. 1/4555 useless extension candidates. Maximal degree in co-relation 26343. Up to 1173 conditions per place. [2022-01-19 00:50:53,375 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 231 selfloop transitions, 162 changer transitions 18/592 dead transitions. [2022-01-19 00:50:53,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 592 transitions, 9112 flow [2022-01-19 00:50:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3590 transitions. [2022-01-19 00:50:53,377 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2022-01-19 00:50:53,377 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3590 transitions. [2022-01-19 00:50:53,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3590 transitions. [2022-01-19 00:50:53,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:53,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3590 transitions. [2022-01-19 00:50:53,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.44444444444446) internal successors, (3590), 18 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,381 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:53,382 INFO L186 Difference]: Start difference. First operand has 707 places, 539 transitions, 7573 flow. Second operand 18 states and 3590 transitions. [2022-01-19 00:50:53,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 592 transitions, 9112 flow [2022-01-19 00:50:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 592 transitions, 8912 flow, removed 100 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:54,017 INFO L242 Difference]: Finished difference. Result has 728 places, 560 transitions, 8248 flow [2022-01-19 00:50:54,018 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=7375, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=8248, PETRI_PLACES=728, PETRI_TRANSITIONS=560} [2022-01-19 00:50:54,018 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 514 predicate places. [2022-01-19 00:50:54,018 INFO L470 AbstractCegarLoop]: Abstraction has has 728 places, 560 transitions, 8248 flow [2022-01-19 00:50:54,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:54,018 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:54,018 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:54,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 00:50:54,019 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:54,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1571864207, now seen corresponding path program 16 times [2022-01-19 00:50:54,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:54,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606449106] [2022-01-19 00:50:54,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:54,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:54,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:54,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606449106] [2022-01-19 00:50:54,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606449106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:54,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:54,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:54,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823222693] [2022-01-19 00:50:54,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:54,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:54,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:54,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:54,080 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:54,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 560 transitions, 8248 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:54,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:54,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:54,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:55,889 INFO L129 PetriNetUnfolder]: 1184/5128 cut-off events. [2022-01-19 00:50:55,889 INFO L130 PetriNetUnfolder]: For 78994/79070 co-relation queries the response was YES. [2022-01-19 00:50:55,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28763 conditions, 5128 events. 1184/5128 cut-off events. For 78994/79070 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 55654 event pairs, 409 based on Foata normal form. 1/4754 useless extension candidates. Maximal degree in co-relation 28482. Up to 1220 conditions per place. [2022-01-19 00:50:55,993 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 279 selfloop transitions, 135 changer transitions 16/611 dead transitions. [2022-01-19 00:50:55,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 611 transitions, 9864 flow [2022-01-19 00:50:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:50:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:50:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3395 transitions. [2022-01-19 00:50:55,995 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8498122653316645 [2022-01-19 00:50:55,995 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3395 transitions. [2022-01-19 00:50:55,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3395 transitions. [2022-01-19 00:50:55,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:55,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3395 transitions. [2022-01-19 00:50:55,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.7058823529412) internal successors, (3395), 17 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:55,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:55,999 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:55,999 INFO L186 Difference]: Start difference. First operand has 728 places, 560 transitions, 8248 flow. Second operand 17 states and 3395 transitions. [2022-01-19 00:50:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 742 places, 611 transitions, 9864 flow [2022-01-19 00:50:56,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 740 places, 611 transitions, 9616 flow, removed 124 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:56,605 INFO L242 Difference]: Finished difference. Result has 749 places, 581 transitions, 8881 flow [2022-01-19 00:50:56,606 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8048, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8881, PETRI_PLACES=749, PETRI_TRANSITIONS=581} [2022-01-19 00:50:56,606 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 535 predicate places. [2022-01-19 00:50:56,606 INFO L470 AbstractCegarLoop]: Abstraction has has 749 places, 581 transitions, 8881 flow [2022-01-19 00:50:56,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:56,606 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:56,607 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:56,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 00:50:56,607 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -653578939, now seen corresponding path program 17 times [2022-01-19 00:50:56,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:56,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007681544] [2022-01-19 00:50:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:56,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:56,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:56,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007681544] [2022-01-19 00:50:56,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007681544] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:56,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:56,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:56,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511212721] [2022-01-19 00:50:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:56,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:56,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:56,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:56,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 749 places, 581 transitions, 8881 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:56,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:56,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:56,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:58,499 INFO L129 PetriNetUnfolder]: 1204/5300 cut-off events. [2022-01-19 00:50:58,499 INFO L130 PetriNetUnfolder]: For 84927/85003 co-relation queries the response was YES. [2022-01-19 00:50:58,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30082 conditions, 5300 events. 1204/5300 cut-off events. For 84927/85003 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 58614 event pairs, 365 based on Foata normal form. 1/4918 useless extension candidates. Maximal degree in co-relation 29793. Up to 1256 conditions per place. [2022-01-19 00:50:58,610 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 304 selfloop transitions, 127 changer transitions 17/629 dead transitions. [2022-01-19 00:50:58,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 764 places, 629 transitions, 10493 flow [2022-01-19 00:50:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:50:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:50:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3594 transitions. [2022-01-19 00:50:58,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849645390070922 [2022-01-19 00:50:58,612 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3594 transitions. [2022-01-19 00:50:58,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3594 transitions. [2022-01-19 00:50:58,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:58,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3594 transitions. [2022-01-19 00:50:58,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.66666666666666) internal successors, (3594), 18 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:58,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:58,616 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:58,616 INFO L186 Difference]: Start difference. First operand has 749 places, 581 transitions, 8881 flow. Second operand 18 states and 3594 transitions. [2022-01-19 00:50:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 764 places, 629 transitions, 10493 flow [2022-01-19 00:50:59,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 762 places, 629 transitions, 10337 flow, removed 78 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:59,216 INFO L242 Difference]: Finished difference. Result has 770 places, 600 transitions, 9545 flow [2022-01-19 00:50:59,216 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8729, PETRI_DIFFERENCE_MINUEND_PLACES=745, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9545, PETRI_PLACES=770, PETRI_TRANSITIONS=600} [2022-01-19 00:50:59,217 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 556 predicate places. [2022-01-19 00:50:59,217 INFO L470 AbstractCegarLoop]: Abstraction has has 770 places, 600 transitions, 9545 flow [2022-01-19 00:50:59,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:59,217 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:59,217 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:59,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-19 00:50:59,217 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:59,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:59,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1442622767, now seen corresponding path program 18 times [2022-01-19 00:50:59,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:59,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719058099] [2022-01-19 00:50:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:59,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:59,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:59,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719058099] [2022-01-19 00:50:59,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719058099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:59,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:59,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:50:59,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169289163] [2022-01-19 00:50:59,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:59,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:50:59,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:50:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:50:59,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:50:59,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 600 transitions, 9545 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:59,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:59,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:50:59,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:01,360 INFO L129 PetriNetUnfolder]: 1204/5340 cut-off events. [2022-01-19 00:51:01,360 INFO L130 PetriNetUnfolder]: For 89886/89962 co-relation queries the response was YES. [2022-01-19 00:51:01,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30749 conditions, 5340 events. 1204/5340 cut-off events. For 89886/89962 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 59314 event pairs, 345 based on Foata normal form. 1/4957 useless extension candidates. Maximal degree in co-relation 30453. Up to 1277 conditions per place. [2022-01-19 00:51:01,474 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 255 selfloop transitions, 179 changer transitions 22/637 dead transitions. [2022-01-19 00:51:01,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 637 transitions, 10835 flow [2022-01-19 00:51:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:51:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:51:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3198 transitions. [2022-01-19 00:51:01,476 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.850531914893617 [2022-01-19 00:51:01,476 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3198 transitions. [2022-01-19 00:51:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3198 transitions. [2022-01-19 00:51:01,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:01,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3198 transitions. [2022-01-19 00:51:01,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 199.875) internal successors, (3198), 16 states have internal predecessors, (3198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,480 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 235.0) internal successors, (3995), 17 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:01,480 INFO L186 Difference]: Start difference. First operand has 770 places, 600 transitions, 9545 flow. Second operand 16 states and 3198 transitions. [2022-01-19 00:51:01,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 637 transitions, 10835 flow [2022-01-19 00:51:02,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 781 places, 637 transitions, 10643 flow, removed 96 selfloop flow, removed 2 redundant places. [2022-01-19 00:51:02,116 INFO L242 Difference]: Finished difference. Result has 788 places, 608 transitions, 9948 flow [2022-01-19 00:51:02,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=9355, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=9948, PETRI_PLACES=788, PETRI_TRANSITIONS=608} [2022-01-19 00:51:02,116 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 574 predicate places. [2022-01-19 00:51:02,117 INFO L470 AbstractCegarLoop]: Abstraction has has 788 places, 608 transitions, 9948 flow [2022-01-19 00:51:02,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:02,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:02,117 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:02,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-19 00:51:02,117 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:02,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash -371373891, now seen corresponding path program 19 times [2022-01-19 00:51:02,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:02,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747446868] [2022-01-19 00:51:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:02,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:51:02,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:02,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747446868] [2022-01-19 00:51:02,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747446868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:02,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:02,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:51:02,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873111674] [2022-01-19 00:51:02,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:02,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:51:02,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:02,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:51:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:51:02,181 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:51:02,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 788 places, 608 transitions, 9948 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:02,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:02,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:51:02,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:04,223 INFO L129 PetriNetUnfolder]: 1235/5609 cut-off events. [2022-01-19 00:51:04,224 INFO L130 PetriNetUnfolder]: For 100181/100257 co-relation queries the response was YES. [2022-01-19 00:51:04,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32671 conditions, 5609 events. 1235/5609 cut-off events. For 100181/100257 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 63527 event pairs, 356 based on Foata normal form. 1/5217 useless extension candidates. Maximal degree in co-relation 32369. Up to 1308 conditions per place. [2022-01-19 00:51:04,357 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 293 selfloop transitions, 153 changer transitions 23/650 dead transitions. [2022-01-19 00:51:04,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 803 places, 650 transitions, 11421 flow [2022-01-19 00:51:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:51:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:51:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3594 transitions. [2022-01-19 00:51:04,360 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849645390070922 [2022-01-19 00:51:04,360 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3594 transitions. [2022-01-19 00:51:04,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3594 transitions. [2022-01-19 00:51:04,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:04,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3594 transitions. [2022-01-19 00:51:04,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 199.66666666666666) internal successors, (3594), 18 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:04,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:04,365 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 235.0) internal successors, (4465), 19 states have internal predecessors, (4465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:04,365 INFO L186 Difference]: Start difference. First operand has 788 places, 608 transitions, 9948 flow. Second operand 18 states and 3594 transitions. [2022-01-19 00:51:04,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 803 places, 650 transitions, 11421 flow [2022-01-19 00:51:05,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 798 places, 650 transitions, 11104 flow, removed 42 selfloop flow, removed 5 redundant places. [2022-01-19 00:51:05,178 INFO L242 Difference]: Finished difference. Result has 805 places, 622 transitions, 10380 flow [2022-01-19 00:51:05,178 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=9653, PETRI_DIFFERENCE_MINUEND_PLACES=781, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10380, PETRI_PLACES=805, PETRI_TRANSITIONS=622} [2022-01-19 00:51:05,179 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 591 predicate places. [2022-01-19 00:51:05,179 INFO L470 AbstractCegarLoop]: Abstraction has has 805 places, 622 transitions, 10380 flow [2022-01-19 00:51:05,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:05,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:05,179 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:05,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-19 00:51:05,179 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash 634310457, now seen corresponding path program 20 times [2022-01-19 00:51:05,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:05,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330840253] [2022-01-19 00:51:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:05,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:51:05,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:05,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330840253] [2022-01-19 00:51:05,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330840253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:05,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:05,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:51:05,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351269577] [2022-01-19 00:51:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:05,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:51:05,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:51:05,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:51:05,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2022-01-19 00:51:05,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 805 places, 622 transitions, 10380 flow. Second operand has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:05,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:05,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2022-01-19 00:51:05,262 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:07,315 INFO L129 PetriNetUnfolder]: 1230/5597 cut-off events. [2022-01-19 00:51:07,315 INFO L130 PetriNetUnfolder]: For 101559/101635 co-relation queries the response was YES. [2022-01-19 00:51:07,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32483 conditions, 5597 events. 1230/5597 cut-off events. For 101559/101635 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 62906 event pairs, 396 based on Foata normal form. 1/5212 useless extension candidates. Maximal degree in co-relation 32176. Up to 1299 conditions per place. [2022-01-19 00:51:07,439 INFO L132 encePairwiseOnDemand]: 222/235 looper letters, 312 selfloop transitions, 138 changer transitions 26/657 dead transitions. [2022-01-19 00:51:07,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 657 transitions, 11682 flow [2022-01-19 00:51:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:51:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:51:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3399 transitions. [2022-01-19 00:51:07,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8508135168961202 [2022-01-19 00:51:07,442 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3399 transitions. [2022-01-19 00:51:07,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3399 transitions. [2022-01-19 00:51:07,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:07,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3399 transitions. [2022-01-19 00:51:07,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.94117647058823) internal successors, (3399), 17 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:07,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:07,446 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 235.0) internal successors, (4230), 18 states have internal predecessors, (4230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:07,446 INFO L186 Difference]: Start difference. First operand has 805 places, 622 transitions, 10380 flow. Second operand 17 states and 3399 transitions. [2022-01-19 00:51:07,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 657 transitions, 11682 flow [2022-01-19 00:51:08,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 657 transitions, 11492 flow, removed 57 selfloop flow, removed 4 redundant places. [2022-01-19 00:51:08,160 INFO L242 Difference]: Finished difference. Result has 822 places, 630 transitions, 10729 flow [2022-01-19 00:51:08,160 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=10196, PETRI_DIFFERENCE_MINUEND_PLACES=799, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10729, PETRI_PLACES=822, PETRI_TRANSITIONS=630} [2022-01-19 00:51:08,161 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 608 predicate places. [2022-01-19 00:51:08,161 INFO L470 AbstractCegarLoop]: Abstraction has has 822 places, 630 transitions, 10729 flow [2022-01-19 00:51:08,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 196.6) internal successors, (1966), 10 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:08,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:08,161 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:08,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-19 00:51:08,161 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash -811522789, now seen corresponding path program 1 times [2022-01-19 00:51:08,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:08,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698223487] [2022-01-19 00:51:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:08,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:51:08,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:08,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698223487] [2022-01-19 00:51:08,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698223487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:08,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:08,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-19 00:51:08,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375594357] [2022-01-19 00:51:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:08,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-19 00:51:08,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-19 00:51:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2022-01-19 00:51:08,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 235 [2022-01-19 00:51:08,775 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 630 transitions, 10729 flow. Second operand has 31 states, 31 states have (on average 149.29032258064515) internal successors, (4628), 31 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:08,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:08,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 235 [2022-01-19 00:51:08,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:42,492 INFO L129 PetriNetUnfolder]: 29155/64540 cut-off events. [2022-01-19 00:51:42,492 INFO L130 PetriNetUnfolder]: For 739211/739286 co-relation queries the response was YES. [2022-01-19 00:51:48,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263235 conditions, 64540 events. 29155/64540 cut-off events. For 739211/739286 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 700488 event pairs, 10204 based on Foata normal form. 1/63087 useless extension candidates. Maximal degree in co-relation 262924. Up to 25596 conditions per place. [2022-01-19 00:51:48,622 INFO L132 encePairwiseOnDemand]: 196/235 looper letters, 1073 selfloop transitions, 153 changer transitions 190/1552 dead transitions. [2022-01-19 00:51:48,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 1552 transitions, 17989 flow [2022-01-19 00:51:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-01-19 00:51:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-01-19 00:51:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 18629 transitions. [2022-01-19 00:51:48,629 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6606028368794327 [2022-01-19 00:51:48,629 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 18629 transitions. [2022-01-19 00:51:48,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 18629 transitions. [2022-01-19 00:51:48,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:48,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 18629 transitions. [2022-01-19 00:51:48,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 155.24166666666667) internal successors, (18629), 120 states have internal predecessors, (18629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:48,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 235.0) internal successors, (28435), 121 states have internal predecessors, (28435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:48,658 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 235.0) internal successors, (28435), 121 states have internal predecessors, (28435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:48,658 INFO L186 Difference]: Start difference. First operand has 822 places, 630 transitions, 10729 flow. Second operand 120 states and 18629 transitions. [2022-01-19 00:51:48,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 1552 transitions, 17989 flow [2022-01-19 00:51:54,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 1552 transitions, 17810 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-01-19 00:51:54,225 INFO L242 Difference]: Finished difference. Result has 1043 places, 788 transitions, 12128 flow [2022-01-19 00:51:54,226 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=10552, PETRI_DIFFERENCE_MINUEND_PLACES=817, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=12128, PETRI_PLACES=1043, PETRI_TRANSITIONS=788} [2022-01-19 00:51:54,226 INFO L334 CegarLoopForPetriNet]: 214 programPoint places, 829 predicate places. [2022-01-19 00:51:54,226 INFO L470 AbstractCegarLoop]: Abstraction has has 1043 places, 788 transitions, 12128 flow [2022-01-19 00:51:54,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 149.29032258064515) internal successors, (4628), 31 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:54,227 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:54,227 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:54,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-19 00:51:54,227 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1471915715, now seen corresponding path program 2 times [2022-01-19 00:51:54,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845637473] [2022-01-19 00:51:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:54,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:51:54,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:54,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845637473] [2022-01-19 00:51:54,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845637473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:54,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:54,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-01-19 00:51:54,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443015385] [2022-01-19 00:51:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:54,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-19 00:51:54,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-19 00:51:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=866, Unknown=0, NotChecked=0, Total=930 [2022-01-19 00:51:54,976 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 235 [2022-01-19 00:51:54,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1043 places, 788 transitions, 12128 flow. Second operand has 31 states, 31 states have (on average 149.29032258064515) internal successors, (4628), 31 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:54,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:54,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 235 [2022-01-19 00:51:54,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand