/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:22:21,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:22:21,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:22:21,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:22:21,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:22:21,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:22:21,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:22:21,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:22:21,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:22:21,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:22:21,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:22:21,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:22:21,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:22:21,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:22:21,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:22:21,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:22:21,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:22:21,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:22:21,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:22:21,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:22:21,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:22:21,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:22:21,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:22:21,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:22:21,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:22:21,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:22:21,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:22:21,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:22:21,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:22:21,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:22:21,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:22:21,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:22:21,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:22:21,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:22:21,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:22:21,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:22:21,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:22:21,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:22:21,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:22:21,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:22:21,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:22:21,394 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-After.epf [2022-01-19 13:22:21,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:22:21,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:22:21,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:22:21,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:22:21,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:22:21,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:22:21,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:22:21,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:22:21,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:22:21,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:22:21,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:22:21,413 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:22:21,414 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 13:22:21,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:22:21,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:22:21,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:22:21,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:22:21,570 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:22:21,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-01-19 13:22:21,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241966eb5/c0e6cb136c464ab9b07d02ad5341f967/FLAG5953c5223 [2022-01-19 13:22:21,972 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:22:21,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2022-01-19 13:22:21,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241966eb5/c0e6cb136c464ab9b07d02ad5341f967/FLAG5953c5223 [2022-01-19 13:22:21,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241966eb5/c0e6cb136c464ab9b07d02ad5341f967 [2022-01-19 13:22:21,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:22:21,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:22:22,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:22:22,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:22:22,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:22:22,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:22:21" (1/1) ... [2022-01-19 13:22:22,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a91f27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22, skipping insertion in model container [2022-01-19 13:22:22,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:22:21" (1/1) ... [2022-01-19 13:22:22,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:22:22,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:22:22,165 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/fibonacci.wvr.c[2330,2343] [2022-01-19 13:22:22,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:22:22,174 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:22:22,186 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/fibonacci.wvr.c[2330,2343] [2022-01-19 13:22:22,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:22:22,196 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:22:22,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22 WrapperNode [2022-01-19 13:22:22,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:22:22,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:22:22,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:22:22,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:22:22,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,228 INFO L137 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2022-01-19 13:22:22,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:22:22,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:22:22,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:22:22,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:22:22,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:22:22,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:22:22,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:22:22,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:22:22,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (1/1) ... [2022-01-19 13:22:22,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:22:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:22,312 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 13:22:22,331 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 13:22:22,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:22:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:22:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:22:22,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:22:22,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:22:22,353 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 13:22:22,421 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:22:22,422 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:22:22,704 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:22:22,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:22:22,712 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 13:22:22,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:22:22 BoogieIcfgContainer [2022-01-19 13:22:22,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:22:22,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:22:22,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:22:22,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:22:22,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:22:21" (1/3) ... [2022-01-19 13:22:22,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da4ff62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:22:22, skipping insertion in model container [2022-01-19 13:22:22,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:22:22" (2/3) ... [2022-01-19 13:22:22,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da4ff62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:22:22, skipping insertion in model container [2022-01-19 13:22:22,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:22:22" (3/3) ... [2022-01-19 13:22:22,734 INFO L111 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2022-01-19 13:22:22,738 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:22:22,738 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:22:22,738 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:22:22,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,789 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,790 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,791 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,792 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,793 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,794 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,795 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,796 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,797 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,798 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,799 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,800 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,801 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,804 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,805 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,806 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,807 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,808 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,809 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,827 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,828 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,829 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,830 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,832 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,833 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,834 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,835 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,852 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,855 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,856 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,857 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,858 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,859 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,875 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,876 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,877 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,878 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,879 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,880 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,881 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,882 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,883 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,884 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,886 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,887 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,907 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,908 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,911 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,912 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,913 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,914 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,919 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,920 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:22:22,922 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 13:22:22,985 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:22:22,989 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 13:22:22,989 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 13:22:23,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 221 places, 230 transitions, 476 flow [2022-01-19 13:22:23,080 INFO L129 PetriNetUnfolder]: 16/228 cut-off events. [2022-01-19 13:22:23,080 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:22:23,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 228 events. 16/228 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 382 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-01-19 13:22:23,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 230 transitions, 476 flow [2022-01-19 13:22:23,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 219 transitions, 450 flow [2022-01-19 13:22:23,128 INFO L129 PetriNetUnfolder]: 10/170 cut-off events. [2022-01-19 13:22:23,129 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:22:23,129 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:23,129 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] [2022-01-19 13:22:23,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1218315603, now seen corresponding path program 1 times [2022-01-19 13:22:23,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:23,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139065984] [2022-01-19 13:22:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:23,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:23,266 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 13:22:23,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139065984] [2022-01-19 13:22:23,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139065984] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:23,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:23,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 13:22:23,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294044641] [2022-01-19 13:22:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:23,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 13:22:23,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 13:22:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 13:22:23,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 230 [2022-01-19 13:22:23,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 219 transitions, 450 flow. Second operand has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 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 13:22:23,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:23,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 230 [2022-01-19 13:22:23,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:23,391 INFO L129 PetriNetUnfolder]: 4/207 cut-off events. [2022-01-19 13:22:23,391 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 13:22:23,395 INFO L84 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 207 events. 4/207 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 320 event pairs, 0 based on Foata normal form. 14/207 useless extension candidates. Maximal degree in co-relation 144. Up to 5 conditions per place. [2022-01-19 13:22:23,397 INFO L132 encePairwiseOnDemand]: 218/230 looper letters, 4 selfloop transitions, 0 changer transitions 2/207 dead transitions. [2022-01-19 13:22:23,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 207 transitions, 434 flow [2022-01-19 13:22:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 13:22:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 13:22:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 442 transitions. [2022-01-19 13:22:23,411 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9608695652173913 [2022-01-19 13:22:23,412 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 442 transitions. [2022-01-19 13:22:23,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 442 transitions. [2022-01-19 13:22:23,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:23,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 442 transitions. [2022-01-19 13:22:23,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 221.0) internal successors, (442), 2 states have internal predecessors, (442), 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 13:22:23,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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 13:22:23,430 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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 13:22:23,431 INFO L186 Difference]: Start difference. First operand has 210 places, 219 transitions, 450 flow. Second operand 2 states and 442 transitions. [2022-01-19 13:22:23,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 207 transitions, 434 flow [2022-01-19 13:22:23,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 426 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 13:22:23,444 INFO L242 Difference]: Finished difference. Result has 207 places, 205 transitions, 414 flow [2022-01-19 13:22:23,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=414, PETRI_PLACES=207, PETRI_TRANSITIONS=205} [2022-01-19 13:22:23,449 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2022-01-19 13:22:23,450 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 205 transitions, 414 flow [2022-01-19 13:22:23,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 215.5) internal successors, (431), 2 states have internal predecessors, (431), 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 13:22:23,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:23,451 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] [2022-01-19 13:22:23,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:22:23,451 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -123752174, now seen corresponding path program 1 times [2022-01-19 13:22:23,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:23,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865482227] [2022-01-19 13:22:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:23,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:23,650 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 13:22:23,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:23,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865482227] [2022-01-19 13:22:23,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865482227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:23,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:23,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:22:23,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749970469] [2022-01-19 13:22:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:23,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:22:23,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:22:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:22:23,654 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 230 [2022-01-19 13:22:23,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 205 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:23,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:23,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 230 [2022-01-19 13:22:23,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:23,876 INFO L129 PetriNetUnfolder]: 103/1035 cut-off events. [2022-01-19 13:22:23,876 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 13:22:23,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 1035 events. 103/1035 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5949 event pairs, 11 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1245. Up to 112 conditions per place. [2022-01-19 13:22:23,882 INFO L132 encePairwiseOnDemand]: 219/230 looper letters, 53 selfloop transitions, 13 changer transitions 0/245 dead transitions. [2022-01-19 13:22:23,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 245 transitions, 634 flow [2022-01-19 13:22:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:22:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:22:23,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1390 transitions. [2022-01-19 13:22:23,886 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633540372670807 [2022-01-19 13:22:23,887 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1390 transitions. [2022-01-19 13:22:23,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1390 transitions. [2022-01-19 13:22:23,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:23,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1390 transitions. [2022-01-19 13:22:23,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.57142857142858) internal successors, (1390), 7 states have internal predecessors, (1390), 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 13:22:23,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:23,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:23,894 INFO L186 Difference]: Start difference. First operand has 207 places, 205 transitions, 414 flow. Second operand 7 states and 1390 transitions. [2022-01-19 13:22:23,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 245 transitions, 634 flow [2022-01-19 13:22:23,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 245 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:22:23,902 INFO L242 Difference]: Finished difference. Result has 214 places, 213 transitions, 485 flow [2022-01-19 13:22:23,903 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=214, PETRI_TRANSITIONS=213} [2022-01-19 13:22:23,903 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2022-01-19 13:22:23,903 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 213 transitions, 485 flow [2022-01-19 13:22:23,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:23,904 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:23,904 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] [2022-01-19 13:22:23,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:22:23,905 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -912411040, now seen corresponding path program 2 times [2022-01-19 13:22:23,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:23,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448046943] [2022-01-19 13:22:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:23,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:24,030 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 13:22:24,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:24,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448046943] [2022-01-19 13:22:24,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448046943] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:24,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:24,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:22:24,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520025996] [2022-01-19 13:22:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:24,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:22:24,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:22:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:22:24,036 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 230 [2022-01-19 13:22:24,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 213 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:24,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:24,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 230 [2022-01-19 13:22:24,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:24,253 INFO L129 PetriNetUnfolder]: 102/1164 cut-off events. [2022-01-19 13:22:24,253 INFO L130 PetriNetUnfolder]: For 185/189 co-relation queries the response was YES. [2022-01-19 13:22:24,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1164 events. 102/1164 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7267 event pairs, 12 based on Foata normal form. 1/1084 useless extension candidates. Maximal degree in co-relation 1536. Up to 117 conditions per place. [2022-01-19 13:22:24,258 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 58 selfloop transitions, 14 changer transitions 0/251 dead transitions. [2022-01-19 13:22:24,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 251 transitions, 741 flow [2022-01-19 13:22:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:22:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:22:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1391 transitions. [2022-01-19 13:22:24,261 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8639751552795031 [2022-01-19 13:22:24,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1391 transitions. [2022-01-19 13:22:24,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1391 transitions. [2022-01-19 13:22:24,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:24,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1391 transitions. [2022-01-19 13:22:24,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.71428571428572) internal successors, (1391), 7 states have internal predecessors, (1391), 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 13:22:24,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:24,266 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:24,266 INFO L186 Difference]: Start difference. First operand has 214 places, 213 transitions, 485 flow. Second operand 7 states and 1391 transitions. [2022-01-19 13:22:24,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 251 transitions, 741 flow [2022-01-19 13:22:24,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 251 transitions, 737 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:22:24,273 INFO L242 Difference]: Finished difference. Result has 221 places, 219 transitions, 560 flow [2022-01-19 13:22:24,273 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=560, PETRI_PLACES=221, PETRI_TRANSITIONS=219} [2022-01-19 13:22:24,275 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 11 predicate places. [2022-01-19 13:22:24,275 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 219 transitions, 560 flow [2022-01-19 13:22:24,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:24,275 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:24,276 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] [2022-01-19 13:22:24,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:22:24,276 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -673188942, now seen corresponding path program 1 times [2022-01-19 13:22:24,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:24,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554984074] [2022-01-19 13:22:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:24,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:24,372 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 13:22:24,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554984074] [2022-01-19 13:22:24,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554984074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:24,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:24,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:24,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598657188] [2022-01-19 13:22:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:24,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:24,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:24,379 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:24,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 219 transitions, 560 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:24,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:24,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:24,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:24,585 INFO L129 PetriNetUnfolder]: 152/1229 cut-off events. [2022-01-19 13:22:24,586 INFO L130 PetriNetUnfolder]: For 147/152 co-relation queries the response was YES. [2022-01-19 13:22:24,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 1229 events. 152/1229 cut-off events. For 147/152 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7370 event pairs, 66 based on Foata normal form. 3/1153 useless extension candidates. Maximal degree in co-relation 1730. Up to 215 conditions per place. [2022-01-19 13:22:24,591 INFO L132 encePairwiseOnDemand]: 218/230 looper letters, 39 selfloop transitions, 6 changer transitions 16/256 dead transitions. [2022-01-19 13:22:24,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 256 transitions, 765 flow [2022-01-19 13:22:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2545 transitions. [2022-01-19 13:22:24,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8511705685618729 [2022-01-19 13:22:24,594 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2545 transitions. [2022-01-19 13:22:24,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2545 transitions. [2022-01-19 13:22:24,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:24,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2545 transitions. [2022-01-19 13:22:24,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.76923076923077) internal successors, (2545), 13 states have internal predecessors, (2545), 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 13:22:24,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:24,602 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:24,602 INFO L186 Difference]: Start difference. First operand has 221 places, 219 transitions, 560 flow. Second operand 13 states and 2545 transitions. [2022-01-19 13:22:24,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 256 transitions, 765 flow [2022-01-19 13:22:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 256 transitions, 759 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 13:22:24,607 INFO L242 Difference]: Finished difference. Result has 242 places, 221 transitions, 607 flow [2022-01-19 13:22:24,607 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=607, PETRI_PLACES=242, PETRI_TRANSITIONS=221} [2022-01-19 13:22:24,608 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 32 predicate places. [2022-01-19 13:22:24,608 INFO L470 AbstractCegarLoop]: Abstraction has has 242 places, 221 transitions, 607 flow [2022-01-19 13:22:24,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:24,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:24,609 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] [2022-01-19 13:22:24,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:22:24,609 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1473973244, now seen corresponding path program 1 times [2022-01-19 13:22:24,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:24,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788050957] [2022-01-19 13:22:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:24,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:24,695 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 13:22:24,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:24,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788050957] [2022-01-19 13:22:24,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788050957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:24,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:24,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:22:24,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691259305] [2022-01-19 13:22:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:24,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:22:24,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:22:24,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:22:24,698 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 230 [2022-01-19 13:22:24,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 221 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:24,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:24,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 230 [2022-01-19 13:22:24,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:24,867 INFO L129 PetriNetUnfolder]: 114/1212 cut-off events. [2022-01-19 13:22:24,867 INFO L130 PetriNetUnfolder]: For 605/631 co-relation queries the response was YES. [2022-01-19 13:22:24,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 1212 events. 114/1212 cut-off events. For 605/631 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7769 event pairs, 25 based on Foata normal form. 11/1136 useless extension candidates. Maximal degree in co-relation 1937. Up to 121 conditions per place. [2022-01-19 13:22:24,873 INFO L132 encePairwiseOnDemand]: 218/230 looper letters, 56 selfloop transitions, 16 changer transitions 0/253 dead transitions. [2022-01-19 13:22:24,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 859 flow [2022-01-19 13:22:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:22:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:22:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1390 transitions. [2022-01-19 13:22:24,876 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633540372670807 [2022-01-19 13:22:24,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1390 transitions. [2022-01-19 13:22:24,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1390 transitions. [2022-01-19 13:22:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:24,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1390 transitions. [2022-01-19 13:22:24,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.57142857142858) internal successors, (1390), 7 states have internal predecessors, (1390), 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 13:22:24,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:24,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:24,882 INFO L186 Difference]: Start difference. First operand has 242 places, 221 transitions, 607 flow. Second operand 7 states and 1390 transitions. [2022-01-19 13:22:24,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 859 flow [2022-01-19 13:22:24,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 253 transitions, 819 flow, removed 15 selfloop flow, removed 9 redundant places. [2022-01-19 13:22:24,889 INFO L242 Difference]: Finished difference. Result has 235 places, 223 transitions, 654 flow [2022-01-19 13:22:24,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=654, PETRI_PLACES=235, PETRI_TRANSITIONS=223} [2022-01-19 13:22:24,890 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 25 predicate places. [2022-01-19 13:22:24,891 INFO L470 AbstractCegarLoop]: Abstraction has has 235 places, 223 transitions, 654 flow [2022-01-19 13:22:24,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:24,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:24,891 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] [2022-01-19 13:22:24,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:22:24,891 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1729373994, now seen corresponding path program 2 times [2022-01-19 13:22:24,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:24,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506243231] [2022-01-19 13:22:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:24,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:24,965 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 13:22:24,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506243231] [2022-01-19 13:22:24,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506243231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:24,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:24,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:22:24,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693357670] [2022-01-19 13:22:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:24,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:22:24,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:22:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:22:24,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 230 [2022-01-19 13:22:24,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 223 transitions, 654 flow. Second operand has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:24,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:24,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 230 [2022-01-19 13:22:24,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:25,162 INFO L129 PetriNetUnfolder]: 110/1203 cut-off events. [2022-01-19 13:22:25,162 INFO L130 PetriNetUnfolder]: For 730/746 co-relation queries the response was YES. [2022-01-19 13:22:25,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 1203 events. 110/1203 cut-off events. For 730/746 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7700 event pairs, 23 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 1866. Up to 135 conditions per place. [2022-01-19 13:22:25,167 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 58 selfloop transitions, 14 changer transitions 0/253 dead transitions. [2022-01-19 13:22:25,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 887 flow [2022-01-19 13:22:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:22:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:22:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1389 transitions. [2022-01-19 13:22:25,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8627329192546583 [2022-01-19 13:22:25,170 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1389 transitions. [2022-01-19 13:22:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1389 transitions. [2022-01-19 13:22:25,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:25,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1389 transitions. [2022-01-19 13:22:25,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.42857142857142) internal successors, (1389), 7 states have internal predecessors, (1389), 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 13:22:25,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:25,174 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 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 13:22:25,174 INFO L186 Difference]: Start difference. First operand has 235 places, 223 transitions, 654 flow. Second operand 7 states and 1389 transitions. [2022-01-19 13:22:25,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 887 flow [2022-01-19 13:22:25,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 253 transitions, 872 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:22:25,179 INFO L242 Difference]: Finished difference. Result has 241 places, 225 transitions, 706 flow [2022-01-19 13:22:25,180 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=706, PETRI_PLACES=241, PETRI_TRANSITIONS=225} [2022-01-19 13:22:25,182 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 31 predicate places. [2022-01-19 13:22:25,182 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 225 transitions, 706 flow [2022-01-19 13:22:25,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 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 13:22:25,182 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:25,183 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] [2022-01-19 13:22:25,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:22:25,183 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:25,184 INFO L85 PathProgramCache]: Analyzing trace with hash 592781596, now seen corresponding path program 2 times [2022-01-19 13:22:25,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:25,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329201596] [2022-01-19 13:22:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:25,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:25,254 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 13:22:25,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:25,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329201596] [2022-01-19 13:22:25,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329201596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:25,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:25,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:25,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688183374] [2022-01-19 13:22:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:25,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:25,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:25,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:25,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 225 transitions, 706 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:25,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:25,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:25,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:25,473 INFO L129 PetriNetUnfolder]: 153/1487 cut-off events. [2022-01-19 13:22:25,473 INFO L130 PetriNetUnfolder]: For 634/647 co-relation queries the response was YES. [2022-01-19 13:22:25,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 1487 events. 153/1487 cut-off events. For 634/647 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9667 event pairs, 76 based on Foata normal form. 3/1396 useless extension candidates. Maximal degree in co-relation 2385. Up to 259 conditions per place. [2022-01-19 13:22:25,481 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 34 selfloop transitions, 8 changer transitions 12/253 dead transitions. [2022-01-19 13:22:25,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 253 transitions, 925 flow [2022-01-19 13:22:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:22:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:22:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2152 transitions. [2022-01-19 13:22:25,484 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.850592885375494 [2022-01-19 13:22:25,484 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:25,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.63636363636363) internal successors, (2152), 11 states have internal predecessors, (2152), 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 13:22:25,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:25,492 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:25,492 INFO L186 Difference]: Start difference. First operand has 241 places, 225 transitions, 706 flow. Second operand 11 states and 2152 transitions. [2022-01-19 13:22:25,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 253 transitions, 925 flow [2022-01-19 13:22:25,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 253 transitions, 912 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 13:22:25,499 INFO L242 Difference]: Finished difference. Result has 256 places, 232 transitions, 771 flow [2022-01-19 13:22:25,499 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=771, PETRI_PLACES=256, PETRI_TRANSITIONS=232} [2022-01-19 13:22:25,499 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 46 predicate places. [2022-01-19 13:22:25,499 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 232 transitions, 771 flow [2022-01-19 13:22:25,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:25,500 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:25,501 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] [2022-01-19 13:22:25,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:22:25,501 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash 963975448, now seen corresponding path program 1 times [2022-01-19 13:22:25,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:25,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509741093] [2022-01-19 13:22:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:25,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:25,559 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 13:22:25,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:25,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509741093] [2022-01-19 13:22:25,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509741093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:25,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:25,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:25,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855466891] [2022-01-19 13:22:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:25,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:25,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:25,562 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:25,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 232 transitions, 771 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:25,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:25,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:25,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:25,778 INFO L129 PetriNetUnfolder]: 159/1511 cut-off events. [2022-01-19 13:22:25,778 INFO L130 PetriNetUnfolder]: For 1134/1159 co-relation queries the response was YES. [2022-01-19 13:22:25,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 1511 events. 159/1511 cut-off events. For 1134/1159 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9883 event pairs, 68 based on Foata normal form. 3/1421 useless extension candidates. Maximal degree in co-relation 2779. Up to 275 conditions per place. [2022-01-19 13:22:25,788 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 40 selfloop transitions, 8 changer transitions 12/259 dead transitions. [2022-01-19 13:22:25,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 259 transitions, 1043 flow [2022-01-19 13:22:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:22:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:22:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2152 transitions. [2022-01-19 13:22:25,791 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.850592885375494 [2022-01-19 13:22:25,791 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:25,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2152 transitions. [2022-01-19 13:22:25,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.63636363636363) internal successors, (2152), 11 states have internal predecessors, (2152), 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 13:22:25,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:25,798 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:25,798 INFO L186 Difference]: Start difference. First operand has 256 places, 232 transitions, 771 flow. Second operand 11 states and 2152 transitions. [2022-01-19 13:22:25,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 259 transitions, 1043 flow [2022-01-19 13:22:25,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 259 transitions, 1023 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-01-19 13:22:25,807 INFO L242 Difference]: Finished difference. Result has 265 places, 238 transitions, 834 flow [2022-01-19 13:22:25,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=834, PETRI_PLACES=265, PETRI_TRANSITIONS=238} [2022-01-19 13:22:25,810 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 55 predicate places. [2022-01-19 13:22:25,810 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 238 transitions, 834 flow [2022-01-19 13:22:25,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:25,817 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:25,817 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] [2022-01-19 13:22:25,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:22:25,818 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash -769828056, now seen corresponding path program 2 times [2022-01-19 13:22:25,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:25,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970476001] [2022-01-19 13:22:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:25,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:25,882 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 13:22:25,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:25,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970476001] [2022-01-19 13:22:25,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970476001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:25,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:25,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:25,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582289664] [2022-01-19 13:22:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:25,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:25,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:25,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:25,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 238 transitions, 834 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:25,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:25,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:25,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:26,126 INFO L129 PetriNetUnfolder]: 155/1519 cut-off events. [2022-01-19 13:22:26,127 INFO L130 PetriNetUnfolder]: For 1707/1744 co-relation queries the response was YES. [2022-01-19 13:22:26,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 1519 events. 155/1519 cut-off events. For 1707/1744 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 10005 event pairs, 52 based on Foata normal form. 7/1437 useless extension candidates. Maximal degree in co-relation 3037. Up to 211 conditions per place. [2022-01-19 13:22:26,136 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 57 selfloop transitions, 6 changer transitions 17/279 dead transitions. [2022-01-19 13:22:26,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 279 transitions, 1263 flow [2022-01-19 13:22:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2543 transitions. [2022-01-19 13:22:26,140 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8505016722408026 [2022-01-19 13:22:26,140 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2543 transitions. [2022-01-19 13:22:26,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2543 transitions. [2022-01-19 13:22:26,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:26,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2543 transitions. [2022-01-19 13:22:26,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.6153846153846) internal successors, (2543), 13 states have internal predecessors, (2543), 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 13:22:26,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:26,148 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:26,148 INFO L186 Difference]: Start difference. First operand has 265 places, 238 transitions, 834 flow. Second operand 13 states and 2543 transitions. [2022-01-19 13:22:26,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 279 transitions, 1263 flow [2022-01-19 13:22:26,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 279 transitions, 1160 flow, removed 45 selfloop flow, removed 7 redundant places. [2022-01-19 13:22:26,157 INFO L242 Difference]: Finished difference. Result has 275 places, 239 transitions, 843 flow [2022-01-19 13:22:26,157 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=843, PETRI_PLACES=275, PETRI_TRANSITIONS=239} [2022-01-19 13:22:26,158 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 65 predicate places. [2022-01-19 13:22:26,158 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 239 transitions, 843 flow [2022-01-19 13:22:26,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:26,158 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] [2022-01-19 13:22:26,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:22:26,158 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:26,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1693242874, now seen corresponding path program 3 times [2022-01-19 13:22:26,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:26,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482898379] [2022-01-19 13:22:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:26,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:26,218 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 13:22:26,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482898379] [2022-01-19 13:22:26,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482898379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:26,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:26,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:26,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718579883] [2022-01-19 13:22:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:26,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:26,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:26,221 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:26,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 239 transitions, 843 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:26,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:26,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:26,420 INFO L129 PetriNetUnfolder]: 152/1535 cut-off events. [2022-01-19 13:22:26,421 INFO L130 PetriNetUnfolder]: For 1906/1949 co-relation queries the response was YES. [2022-01-19 13:22:26,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1535 events. 152/1535 cut-off events. For 1906/1949 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10218 event pairs, 46 based on Foata normal form. 5/1452 useless extension candidates. Maximal degree in co-relation 3085. Up to 195 conditions per place. [2022-01-19 13:22:26,431 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 59 selfloop transitions, 6 changer transitions 16/280 dead transitions. [2022-01-19 13:22:26,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 1305 flow [2022-01-19 13:22:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2545 transitions. [2022-01-19 13:22:26,434 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8511705685618729 [2022-01-19 13:22:26,434 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2545 transitions. [2022-01-19 13:22:26,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2545 transitions. [2022-01-19 13:22:26,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:26,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2545 transitions. [2022-01-19 13:22:26,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.76923076923077) internal successors, (2545), 13 states have internal predecessors, (2545), 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 13:22:26,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:26,441 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:26,441 INFO L186 Difference]: Start difference. First operand has 275 places, 239 transitions, 843 flow. Second operand 13 states and 2545 transitions. [2022-01-19 13:22:26,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 1305 flow [2022-01-19 13:22:26,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 280 transitions, 1259 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-01-19 13:22:26,451 INFO L242 Difference]: Finished difference. Result has 280 places, 239 transitions, 862 flow [2022-01-19 13:22:26,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=862, PETRI_PLACES=280, PETRI_TRANSITIONS=239} [2022-01-19 13:22:26,452 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 70 predicate places. [2022-01-19 13:22:26,452 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 239 transitions, 862 flow [2022-01-19 13:22:26,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,452 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:26,452 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] [2022-01-19 13:22:26,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:22:26,453 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1108970958, now seen corresponding path program 4 times [2022-01-19 13:22:26,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:26,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634624580] [2022-01-19 13:22:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:26,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:26,501 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 13:22:26,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:26,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634624580] [2022-01-19 13:22:26,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634624580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:26,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:26,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:26,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038406524] [2022-01-19 13:22:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:26,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:26,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:26,504 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:26,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 239 transitions, 862 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:26,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:26,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:26,705 INFO L129 PetriNetUnfolder]: 139/1389 cut-off events. [2022-01-19 13:22:26,705 INFO L130 PetriNetUnfolder]: For 2224/2272 co-relation queries the response was YES. [2022-01-19 13:22:26,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3051 conditions, 1389 events. 139/1389 cut-off events. For 2224/2272 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8934 event pairs, 64 based on Foata normal form. 3/1310 useless extension candidates. Maximal degree in co-relation 3009. Up to 285 conditions per place. [2022-01-19 13:22:26,714 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 42 selfloop transitions, 10 changer transitions 11/262 dead transitions. [2022-01-19 13:22:26,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 262 transitions, 1204 flow [2022-01-19 13:22:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:22:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:22:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2150 transitions. [2022-01-19 13:22:26,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.849802371541502 [2022-01-19 13:22:26,718 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2150 transitions. [2022-01-19 13:22:26,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2150 transitions. [2022-01-19 13:22:26,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:26,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2150 transitions. [2022-01-19 13:22:26,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.45454545454547) internal successors, (2150), 11 states have internal predecessors, (2150), 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 13:22:26,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:26,725 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:26,725 INFO L186 Difference]: Start difference. First operand has 280 places, 239 transitions, 862 flow. Second operand 11 states and 2150 transitions. [2022-01-19 13:22:26,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 262 transitions, 1204 flow [2022-01-19 13:22:26,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 262 transitions, 1125 flow, removed 23 selfloop flow, removed 11 redundant places. [2022-01-19 13:22:26,733 INFO L242 Difference]: Finished difference. Result has 279 places, 245 transitions, 940 flow [2022-01-19 13:22:26,733 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=940, PETRI_PLACES=279, PETRI_TRANSITIONS=245} [2022-01-19 13:22:26,733 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 69 predicate places. [2022-01-19 13:22:26,734 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 245 transitions, 940 flow [2022-01-19 13:22:26,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,734 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:26,734 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] [2022-01-19 13:22:26,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:22:26,734 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1358536022, now seen corresponding path program 5 times [2022-01-19 13:22:26,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:26,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516732375] [2022-01-19 13:22:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:26,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:26,791 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 13:22:26,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516732375] [2022-01-19 13:22:26,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516732375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:26,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:26,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:26,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713798460] [2022-01-19 13:22:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:26,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:26,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:26,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:26,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:26,793 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:26,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 245 transitions, 940 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:26,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:26,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:26,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:26,988 INFO L129 PetriNetUnfolder]: 133/1467 cut-off events. [2022-01-19 13:22:26,988 INFO L130 PetriNetUnfolder]: For 2100/2157 co-relation queries the response was YES. [2022-01-19 13:22:26,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3031 conditions, 1467 events. 133/1467 cut-off events. For 2100/2157 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9640 event pairs, 60 based on Foata normal form. 11/1391 useless extension candidates. Maximal degree in co-relation 2989. Up to 265 conditions per place. [2022-01-19 13:22:27,000 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 41 selfloop transitions, 4 changer transitions 18/262 dead transitions. [2022-01-19 13:22:27,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 262 transitions, 1198 flow [2022-01-19 13:22:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:22:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:22:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2341 transitions. [2022-01-19 13:22:27,003 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8481884057971014 [2022-01-19 13:22:27,004 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2341 transitions. [2022-01-19 13:22:27,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2341 transitions. [2022-01-19 13:22:27,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:27,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2341 transitions. [2022-01-19 13:22:27,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 195.08333333333334) internal successors, (2341), 12 states have internal predecessors, (2341), 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 13:22:27,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,009 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,009 INFO L186 Difference]: Start difference. First operand has 279 places, 245 transitions, 940 flow. Second operand 12 states and 2341 transitions. [2022-01-19 13:22:27,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 262 transitions, 1198 flow [2022-01-19 13:22:27,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 262 transitions, 1141 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-01-19 13:22:27,019 INFO L242 Difference]: Finished difference. Result has 286 places, 239 transitions, 862 flow [2022-01-19 13:22:27,020 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=862, PETRI_PLACES=286, PETRI_TRANSITIONS=239} [2022-01-19 13:22:27,020 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 76 predicate places. [2022-01-19 13:22:27,020 INFO L470 AbstractCegarLoop]: Abstraction has has 286 places, 239 transitions, 862 flow [2022-01-19 13:22:27,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,021 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:27,021 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] [2022-01-19 13:22:27,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:22:27,021 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1201816088, now seen corresponding path program 6 times [2022-01-19 13:22:27,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:27,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657741012] [2022-01-19 13:22:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:27,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:27,058 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 13:22:27,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:27,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657741012] [2022-01-19 13:22:27,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657741012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:27,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:27,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:27,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691552060] [2022-01-19 13:22:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:27,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:27,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:27,061 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:27,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 239 transitions, 862 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:27,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:27,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:27,295 INFO L129 PetriNetUnfolder]: 127/1421 cut-off events. [2022-01-19 13:22:27,295 INFO L130 PetriNetUnfolder]: For 1953/2006 co-relation queries the response was YES. [2022-01-19 13:22:27,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 1421 events. 127/1421 cut-off events. For 1953/2006 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9146 event pairs, 60 based on Foata normal form. 5/1338 useless extension candidates. Maximal degree in co-relation 2787. Up to 241 conditions per place. [2022-01-19 13:22:27,306 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 36 selfloop transitions, 2 changer transitions 19/254 dead transitions. [2022-01-19 13:22:27,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 254 transitions, 1071 flow [2022-01-19 13:22:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:22:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:22:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2340 transitions. [2022-01-19 13:22:27,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-01-19 13:22:27,308 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2340 transitions. [2022-01-19 13:22:27,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2340 transitions. [2022-01-19 13:22:27,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:27,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2340 transitions. [2022-01-19 13:22:27,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 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 13:22:27,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,314 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,314 INFO L186 Difference]: Start difference. First operand has 286 places, 239 transitions, 862 flow. Second operand 12 states and 2340 transitions. [2022-01-19 13:22:27,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 254 transitions, 1071 flow [2022-01-19 13:22:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 254 transitions, 1007 flow, removed 19 selfloop flow, removed 13 redundant places. [2022-01-19 13:22:27,322 INFO L242 Difference]: Finished difference. Result has 278 places, 231 transitions, 774 flow [2022-01-19 13:22:27,322 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=774, PETRI_PLACES=278, PETRI_TRANSITIONS=231} [2022-01-19 13:22:27,323 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 68 predicate places. [2022-01-19 13:22:27,323 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 231 transitions, 774 flow [2022-01-19 13:22:27,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,323 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:27,323 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] [2022-01-19 13:22:27,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:22:27,324 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:27,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1115789980, now seen corresponding path program 3 times [2022-01-19 13:22:27,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:27,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392120515] [2022-01-19 13:22:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:27,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:27,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 13:22:27,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:27,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392120515] [2022-01-19 13:22:27,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392120515] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:27,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:27,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:27,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057928120] [2022-01-19 13:22:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:27,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:27,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:27,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:27,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:27,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:27,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 231 transitions, 774 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:27,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:27,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:27,605 INFO L129 PetriNetUnfolder]: 124/1396 cut-off events. [2022-01-19 13:22:27,605 INFO L130 PetriNetUnfolder]: For 1369/1402 co-relation queries the response was YES. [2022-01-19 13:22:27,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2594 conditions, 1396 events. 124/1396 cut-off events. For 1369/1402 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8977 event pairs, 36 based on Foata normal form. 7/1321 useless extension candidates. Maximal degree in co-relation 2554. Up to 132 conditions per place. [2022-01-19 13:22:27,614 INFO L132 encePairwiseOnDemand]: 219/230 looper letters, 49 selfloop transitions, 8 changer transitions 17/271 dead transitions. [2022-01-19 13:22:27,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 1141 flow [2022-01-19 13:22:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2543 transitions. [2022-01-19 13:22:27,617 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8505016722408026 [2022-01-19 13:22:27,617 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2543 transitions. [2022-01-19 13:22:27,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2543 transitions. [2022-01-19 13:22:27,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:27,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2543 transitions. [2022-01-19 13:22:27,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.6153846153846) internal successors, (2543), 13 states have internal predecessors, (2543), 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 13:22:27,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:27,622 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:27,622 INFO L186 Difference]: Start difference. First operand has 278 places, 231 transitions, 774 flow. Second operand 13 states and 2543 transitions. [2022-01-19 13:22:27,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 1141 flow [2022-01-19 13:22:27,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 271 transitions, 1070 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-01-19 13:22:27,629 INFO L242 Difference]: Finished difference. Result has 273 places, 231 transitions, 776 flow [2022-01-19 13:22:27,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=776, PETRI_PLACES=273, PETRI_TRANSITIONS=231} [2022-01-19 13:22:27,630 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 63 predicate places. [2022-01-19 13:22:27,630 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 231 transitions, 776 flow [2022-01-19 13:22:27,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,631 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:27,631 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] [2022-01-19 13:22:27,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:22:27,631 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1968758762, now seen corresponding path program 4 times [2022-01-19 13:22:27,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:27,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840104681] [2022-01-19 13:22:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:27,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:27,667 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 13:22:27,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840104681] [2022-01-19 13:22:27,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840104681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:27,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:27,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:27,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084975378] [2022-01-19 13:22:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:27,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:27,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:27,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:27,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:27,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:27,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 231 transitions, 776 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:27,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:27,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:27,846 INFO L129 PetriNetUnfolder]: 114/1260 cut-off events. [2022-01-19 13:22:27,846 INFO L130 PetriNetUnfolder]: For 1423/1462 co-relation queries the response was YES. [2022-01-19 13:22:27,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1260 events. 114/1260 cut-off events. For 1423/1462 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7730 event pairs, 44 based on Foata normal form. 3/1188 useless extension candidates. Maximal degree in co-relation 2400. Up to 194 conditions per place. [2022-01-19 13:22:27,854 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 37 selfloop transitions, 10 changer transitions 12/256 dead transitions. [2022-01-19 13:22:27,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 256 transitions, 1084 flow [2022-01-19 13:22:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:22:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:22:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2343 transitions. [2022-01-19 13:22:27,857 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8489130434782609 [2022-01-19 13:22:27,857 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2343 transitions. [2022-01-19 13:22:27,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2343 transitions. [2022-01-19 13:22:27,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:27,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2343 transitions. [2022-01-19 13:22:27,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 195.25) internal successors, (2343), 12 states have internal predecessors, (2343), 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 13:22:27,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,862 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:27,862 INFO L186 Difference]: Start difference. First operand has 273 places, 231 transitions, 776 flow. Second operand 12 states and 2343 transitions. [2022-01-19 13:22:27,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 256 transitions, 1084 flow [2022-01-19 13:22:27,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 256 transitions, 1000 flow, removed 18 selfloop flow, removed 12 redundant places. [2022-01-19 13:22:27,869 INFO L242 Difference]: Finished difference. Result has 271 places, 237 transitions, 832 flow [2022-01-19 13:22:27,869 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=832, PETRI_PLACES=271, PETRI_TRANSITIONS=237} [2022-01-19 13:22:27,869 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 61 predicate places. [2022-01-19 13:22:27,869 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 237 transitions, 832 flow [2022-01-19 13:22:27,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,870 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:27,870 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] [2022-01-19 13:22:27,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:22:27,870 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash -416983822, now seen corresponding path program 5 times [2022-01-19 13:22:27,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:27,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490521856] [2022-01-19 13:22:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:27,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:27,907 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 13:22:27,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490521856] [2022-01-19 13:22:27,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490521856] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:27,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:27,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:27,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018170366] [2022-01-19 13:22:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:27,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:27,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:27,910 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:27,911 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 237 transitions, 832 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:27,911 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:27,911 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:27,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:28,107 INFO L129 PetriNetUnfolder]: 106/1340 cut-off events. [2022-01-19 13:22:28,107 INFO L130 PetriNetUnfolder]: For 1450/1504 co-relation queries the response was YES. [2022-01-19 13:22:28,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2457 conditions, 1340 events. 106/1340 cut-off events. For 1450/1504 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8476 event pairs, 44 based on Foata normal form. 11/1269 useless extension candidates. Maximal degree in co-relation 2419. Up to 192 conditions per place. [2022-01-19 13:22:28,115 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 35 selfloop transitions, 4 changer transitions 16/252 dead transitions. [2022-01-19 13:22:28,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 252 transitions, 1038 flow [2022-01-19 13:22:28,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:22:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:22:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2148 transitions. [2022-01-19 13:22:28,117 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8490118577075099 [2022-01-19 13:22:28,117 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2148 transitions. [2022-01-19 13:22:28,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2148 transitions. [2022-01-19 13:22:28,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:28,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2148 transitions. [2022-01-19 13:22:28,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 195.27272727272728) internal successors, (2148), 11 states have internal predecessors, (2148), 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 13:22:28,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:28,121 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 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 13:22:28,121 INFO L186 Difference]: Start difference. First operand has 271 places, 237 transitions, 832 flow. Second operand 11 states and 2148 transitions. [2022-01-19 13:22:28,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 252 transitions, 1038 flow [2022-01-19 13:22:28,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 252 transitions, 1012 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-01-19 13:22:28,128 INFO L242 Difference]: Finished difference. Result has 277 places, 231 transitions, 778 flow [2022-01-19 13:22:28,129 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=778, PETRI_PLACES=277, PETRI_TRANSITIONS=231} [2022-01-19 13:22:28,129 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 67 predicate places. [2022-01-19 13:22:28,129 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 231 transitions, 778 flow [2022-01-19 13:22:28,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:28,129 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:28,130 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] [2022-01-19 13:22:28,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:22:28,130 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:28,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1458226200, now seen corresponding path program 6 times [2022-01-19 13:22:28,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326455782] [2022-01-19 13:22:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:28,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:28,163 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 13:22:28,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:28,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326455782] [2022-01-19 13:22:28,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326455782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:28,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:28,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:22:28,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183253962] [2022-01-19 13:22:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:28,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:22:28,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:28,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:22:28,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:22:28,165 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230 [2022-01-19 13:22:28,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 231 transitions, 778 flow. Second operand has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:28,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:28,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230 [2022-01-19 13:22:28,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:28,336 INFO L129 PetriNetUnfolder]: 102/1296 cut-off events. [2022-01-19 13:22:28,336 INFO L130 PetriNetUnfolder]: For 1523/1573 co-relation queries the response was YES. [2022-01-19 13:22:28,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1296 events. 102/1296 cut-off events. For 1523/1573 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8061 event pairs, 44 based on Foata normal form. 5/1218 useless extension candidates. Maximal degree in co-relation 2297. Up to 164 conditions per place. [2022-01-19 13:22:28,344 INFO L132 encePairwiseOnDemand]: 221/230 looper letters, 30 selfloop transitions, 2 changer transitions 19/246 dead transitions. [2022-01-19 13:22:28,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 246 transitions, 973 flow [2022-01-19 13:22:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 13:22:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 13:22:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2340 transitions. [2022-01-19 13:22:28,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-01-19 13:22:28,346 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2340 transitions. [2022-01-19 13:22:28,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2340 transitions. [2022-01-19 13:22:28,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:28,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2340 transitions. [2022-01-19 13:22:28,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 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 13:22:28,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:28,352 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 230.0) internal successors, (2990), 13 states have internal predecessors, (2990), 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 13:22:28,352 INFO L186 Difference]: Start difference. First operand has 277 places, 231 transitions, 778 flow. Second operand 12 states and 2340 transitions. [2022-01-19 13:22:28,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 246 transitions, 973 flow [2022-01-19 13:22:28,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 246 transitions, 923 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-01-19 13:22:28,358 INFO L242 Difference]: Finished difference. Result has 272 places, 223 transitions, 709 flow [2022-01-19 13:22:28,358 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=709, PETRI_PLACES=272, PETRI_TRANSITIONS=223} [2022-01-19 13:22:28,358 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 62 predicate places. [2022-01-19 13:22:28,359 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 223 transitions, 709 flow [2022-01-19 13:22:28,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.75) internal successors, (1550), 8 states have internal predecessors, (1550), 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 13:22:28,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:28,359 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] [2022-01-19 13:22:28,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:22:28,359 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash 522220320, now seen corresponding path program 1 times [2022-01-19 13:22:28,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170242040] [2022-01-19 13:22:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:28,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:28,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:28,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170242040] [2022-01-19 13:22:28,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170242040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:28,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:28,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:22:28,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091245022] [2022-01-19 13:22:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:28,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:22:28,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:28,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:22:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:22:28,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:28,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 223 transitions, 709 flow. Second operand has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:28,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:28,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:28,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:28,593 INFO L129 PetriNetUnfolder]: 130/2075 cut-off events. [2022-01-19 13:22:28,594 INFO L130 PetriNetUnfolder]: For 1225/1247 co-relation queries the response was YES. [2022-01-19 13:22:28,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 2075 events. 130/2075 cut-off events. For 1225/1247 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14876 event pairs, 49 based on Foata normal form. 1/1912 useless extension candidates. Maximal degree in co-relation 3151. Up to 120 conditions per place. [2022-01-19 13:22:28,606 INFO L132 encePairwiseOnDemand]: 223/230 looper letters, 27 selfloop transitions, 5 changer transitions 3/242 dead transitions. [2022-01-19 13:22:28,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 242 transitions, 821 flow [2022-01-19 13:22:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:22:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:22:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1242 transitions. [2022-01-19 13:22:28,608 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-01-19 13:22:28,608 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1242 transitions. [2022-01-19 13:22:28,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1242 transitions. [2022-01-19 13:22:28,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:28,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1242 transitions. [2022-01-19 13:22:28,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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 13:22:28,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:28,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:28,611 INFO L186 Difference]: Start difference. First operand has 272 places, 223 transitions, 709 flow. Second operand 6 states and 1242 transitions. [2022-01-19 13:22:28,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 242 transitions, 821 flow [2022-01-19 13:22:28,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 242 transitions, 783 flow, removed 9 selfloop flow, removed 14 redundant places. [2022-01-19 13:22:28,656 INFO L242 Difference]: Finished difference. Result has 254 places, 225 transitions, 697 flow [2022-01-19 13:22:28,657 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=254, PETRI_TRANSITIONS=225} [2022-01-19 13:22:28,657 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 44 predicate places. [2022-01-19 13:22:28,657 INFO L470 AbstractCegarLoop]: Abstraction has has 254 places, 225 transitions, 697 flow [2022-01-19 13:22:28,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:28,657 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:28,657 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] [2022-01-19 13:22:28,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:22:28,658 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash 658946078, now seen corresponding path program 2 times [2022-01-19 13:22:28,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222205981] [2022-01-19 13:22:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:28,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:28,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222205981] [2022-01-19 13:22:28,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222205981] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:28,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129224071] [2022-01-19 13:22:28,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:22:28,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:28,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:28,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 13:22:28,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:22:28,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:22:28,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:28,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:28,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:29,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129224071] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:29,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:29,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-01-19 13:22:29,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780400439] [2022-01-19 13:22:29,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:29,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:22:29,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:22:29,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:22:29,110 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:29,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 225 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 203.22222222222223) internal successors, (1829), 9 states have internal predecessors, (1829), 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 13:22:29,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:29,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:29,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:29,503 INFO L129 PetriNetUnfolder]: 191/3256 cut-off events. [2022-01-19 13:22:29,503 INFO L130 PetriNetUnfolder]: For 1154/1186 co-relation queries the response was YES. [2022-01-19 13:22:29,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4669 conditions, 3256 events. 191/3256 cut-off events. For 1154/1186 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 25567 event pairs, 41 based on Foata normal form. 9/3067 useless extension candidates. Maximal degree in co-relation 4637. Up to 80 conditions per place. [2022-01-19 13:22:29,526 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 51 selfloop transitions, 31 changer transitions 1/290 dead transitions. [2022-01-19 13:22:29,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 290 transitions, 1077 flow [2022-01-19 13:22:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 13:22:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 13:22:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2890 transitions. [2022-01-19 13:22:29,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8975155279503105 [2022-01-19 13:22:29,529 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2890 transitions. [2022-01-19 13:22:29,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2890 transitions. [2022-01-19 13:22:29,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:29,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2890 transitions. [2022-01-19 13:22:29,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 206.42857142857142) internal successors, (2890), 14 states have internal predecessors, (2890), 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 13:22:29,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 230.0) internal successors, (3450), 15 states have internal predecessors, (3450), 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 13:22:29,536 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 230.0) internal successors, (3450), 15 states have internal predecessors, (3450), 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 13:22:29,536 INFO L186 Difference]: Start difference. First operand has 254 places, 225 transitions, 697 flow. Second operand 14 states and 2890 transitions. [2022-01-19 13:22:29,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 290 transitions, 1077 flow [2022-01-19 13:22:29,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 290 transitions, 1050 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-01-19 13:22:29,545 INFO L242 Difference]: Finished difference. Result has 270 places, 257 transitions, 909 flow [2022-01-19 13:22:29,545 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=909, PETRI_PLACES=270, PETRI_TRANSITIONS=257} [2022-01-19 13:22:29,545 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 60 predicate places. [2022-01-19 13:22:29,545 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 257 transitions, 909 flow [2022-01-19 13:22:29,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 203.22222222222223) internal successors, (1829), 9 states have internal predecessors, (1829), 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 13:22:29,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:29,546 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] [2022-01-19 13:22:29,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 13:22:29,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:29,763 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash -603143444, now seen corresponding path program 3 times [2022-01-19 13:22:29,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:29,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044816554] [2022-01-19 13:22:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:29,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:29,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:29,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044816554] [2022-01-19 13:22:29,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044816554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:29,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:29,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:22:29,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992942139] [2022-01-19 13:22:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:29,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:22:29,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:22:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:22:29,806 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:29,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 257 transitions, 909 flow. Second operand has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:29,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:29,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:29,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:30,216 INFO L129 PetriNetUnfolder]: 232/3508 cut-off events. [2022-01-19 13:22:30,216 INFO L130 PetriNetUnfolder]: For 1914/1953 co-relation queries the response was YES. [2022-01-19 13:22:30,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 3508 events. 232/3508 cut-off events. For 1914/1953 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 28024 event pairs, 81 based on Foata normal form. 8/3291 useless extension candidates. Maximal degree in co-relation 5475. Up to 199 conditions per place. [2022-01-19 13:22:30,239 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 61 selfloop transitions, 18 changer transitions 6/292 dead transitions. [2022-01-19 13:22:30,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 292 transitions, 1267 flow [2022-01-19 13:22:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:22:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:22:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-01-19 13:22:30,240 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9108695652173913 [2022-01-19 13:22:30,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-01-19 13:22:30,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-01-19 13:22:30,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:30,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-01-19 13:22:30,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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 13:22:30,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:30,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:30,243 INFO L186 Difference]: Start difference. First operand has 270 places, 257 transitions, 909 flow. Second operand 6 states and 1257 transitions. [2022-01-19 13:22:30,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 292 transitions, 1267 flow [2022-01-19 13:22:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 292 transitions, 1265 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 13:22:30,253 INFO L242 Difference]: Finished difference. Result has 277 places, 265 transitions, 1024 flow [2022-01-19 13:22:30,254 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1024, PETRI_PLACES=277, PETRI_TRANSITIONS=265} [2022-01-19 13:22:30,254 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 67 predicate places. [2022-01-19 13:22:30,254 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 265 transitions, 1024 flow [2022-01-19 13:22:30,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:30,254 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:30,254 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] [2022-01-19 13:22:30,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:22:30,255 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -417482268, now seen corresponding path program 1 times [2022-01-19 13:22:30,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405724847] [2022-01-19 13:22:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:30,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:30,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:30,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405724847] [2022-01-19 13:22:30,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405724847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:30,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:30,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:22:30,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171010438] [2022-01-19 13:22:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:30,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:22:30,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:22:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:22:30,288 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:30,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 265 transitions, 1024 flow. Second operand has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:30,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:30,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:30,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:30,676 INFO L129 PetriNetUnfolder]: 219/3384 cut-off events. [2022-01-19 13:22:30,677 INFO L130 PetriNetUnfolder]: For 2113/2153 co-relation queries the response was YES. [2022-01-19 13:22:30,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 3384 events. 219/3384 cut-off events. For 2113/2153 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 26470 event pairs, 84 based on Foata normal form. 6/3171 useless extension candidates. Maximal degree in co-relation 5366. Up to 185 conditions per place. [2022-01-19 13:22:30,697 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 69 selfloop transitions, 26 changer transitions 3/305 dead transitions. [2022-01-19 13:22:30,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 305 transitions, 1449 flow [2022-01-19 13:22:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:22:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:22:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1255 transitions. [2022-01-19 13:22:30,699 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9094202898550725 [2022-01-19 13:22:30,700 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1255 transitions. [2022-01-19 13:22:30,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1255 transitions. [2022-01-19 13:22:30,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:30,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1255 transitions. [2022-01-19 13:22:30,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.16666666666666) internal successors, (1255), 6 states have internal predecessors, (1255), 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 13:22:30,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:30,704 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 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 13:22:30,704 INFO L186 Difference]: Start difference. First operand has 277 places, 265 transitions, 1024 flow. Second operand 6 states and 1255 transitions. [2022-01-19 13:22:30,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 305 transitions, 1449 flow [2022-01-19 13:22:30,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 305 transitions, 1432 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 13:22:30,716 INFO L242 Difference]: Finished difference. Result has 284 places, 273 transitions, 1176 flow [2022-01-19 13:22:30,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1176, PETRI_PLACES=284, PETRI_TRANSITIONS=273} [2022-01-19 13:22:30,716 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 74 predicate places. [2022-01-19 13:22:30,717 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 273 transitions, 1176 flow [2022-01-19 13:22:30,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:30,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:30,717 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] [2022-01-19 13:22:30,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:22:30,717 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2007793182, now seen corresponding path program 2 times [2022-01-19 13:22:30,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:30,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831701234] [2022-01-19 13:22:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:30,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:30,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:30,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831701234] [2022-01-19 13:22:30,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831701234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:30,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028416496] [2022-01-19 13:22:30,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:22:30,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:30,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:30,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 13:22:30,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:22:30,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:22:30,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:30,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:31,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:31,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028416496] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:31,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:31,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-01-19 13:22:31,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471821247] [2022-01-19 13:22:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:31,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:22:31,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:22:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:22:31,227 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:31,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 273 transitions, 1176 flow. Second operand has 9 states, 9 states have (on average 203.22222222222223) internal successors, (1829), 9 states have internal predecessors, (1829), 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 13:22:31,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:31,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:31,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:31,639 INFO L129 PetriNetUnfolder]: 242/3882 cut-off events. [2022-01-19 13:22:31,640 INFO L130 PetriNetUnfolder]: For 2697/2728 co-relation queries the response was YES. [2022-01-19 13:22:31,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6298 conditions, 3882 events. 242/3882 cut-off events. For 2697/2728 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 32472 event pairs, 51 based on Foata normal form. 8/3644 useless extension candidates. Maximal degree in co-relation 6254. Up to 92 conditions per place. [2022-01-19 13:22:31,666 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 65 selfloop transitions, 71 changer transitions 4/347 dead transitions. [2022-01-19 13:22:31,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 347 transitions, 1939 flow [2022-01-19 13:22:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 13:22:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 13:22:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2887 transitions. [2022-01-19 13:22:31,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.896583850931677 [2022-01-19 13:22:31,668 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2887 transitions. [2022-01-19 13:22:31,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2887 transitions. [2022-01-19 13:22:31,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:31,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2887 transitions. [2022-01-19 13:22:31,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 206.21428571428572) internal successors, (2887), 14 states have internal predecessors, (2887), 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 13:22:31,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 230.0) internal successors, (3450), 15 states have internal predecessors, (3450), 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 13:22:31,675 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 230.0) internal successors, (3450), 15 states have internal predecessors, (3450), 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 13:22:31,675 INFO L186 Difference]: Start difference. First operand has 284 places, 273 transitions, 1176 flow. Second operand 14 states and 2887 transitions. [2022-01-19 13:22:31,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 347 transitions, 1939 flow [2022-01-19 13:22:31,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 347 transitions, 1909 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-01-19 13:22:31,689 INFO L242 Difference]: Finished difference. Result has 304 places, 311 transitions, 1712 flow [2022-01-19 13:22:31,689 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1712, PETRI_PLACES=304, PETRI_TRANSITIONS=311} [2022-01-19 13:22:31,690 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 94 predicate places. [2022-01-19 13:22:31,690 INFO L470 AbstractCegarLoop]: Abstraction has has 304 places, 311 transitions, 1712 flow [2022-01-19 13:22:31,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 203.22222222222223) internal successors, (1829), 9 states have internal predecessors, (1829), 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 13:22:31,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:31,690 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] [2022-01-19 13:22:31,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 13:22:31,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-19 13:22:31,906 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1210834426, now seen corresponding path program 3 times [2022-01-19 13:22:31,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:31,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062653278] [2022-01-19 13:22:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:31,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:31,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:31,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062653278] [2022-01-19 13:22:31,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062653278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:22:31,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:22:31,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:22:31,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308200230] [2022-01-19 13:22:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:22:31,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:22:31,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:22:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:22:31,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:31,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 311 transitions, 1712 flow. Second operand has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:31,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:31,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:31,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:32,319 INFO L129 PetriNetUnfolder]: 220/3486 cut-off events. [2022-01-19 13:22:32,320 INFO L130 PetriNetUnfolder]: For 3145/3165 co-relation queries the response was YES. [2022-01-19 13:22:32,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 3486 events. 220/3486 cut-off events. For 3145/3165 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 28166 event pairs, 80 based on Foata normal form. 5/3265 useless extension candidates. Maximal degree in co-relation 5911. Up to 202 conditions per place. [2022-01-19 13:22:32,365 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 85 selfloop transitions, 29 changer transitions 1/322 dead transitions. [2022-01-19 13:22:32,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 322 transitions, 1983 flow [2022-01-19 13:22:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:22:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:22:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1046 transitions. [2022-01-19 13:22:32,366 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9095652173913044 [2022-01-19 13:22:32,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1046 transitions. [2022-01-19 13:22:32,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1046 transitions. [2022-01-19 13:22:32,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:32,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1046 transitions. [2022-01-19 13:22:32,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 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 13:22:32,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 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 13:22:32,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 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 13:22:32,369 INFO L186 Difference]: Start difference. First operand has 304 places, 311 transitions, 1712 flow. Second operand 5 states and 1046 transitions. [2022-01-19 13:22:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 322 transitions, 1983 flow [2022-01-19 13:22:32,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 322 transitions, 1846 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-01-19 13:22:32,385 INFO L242 Difference]: Finished difference. Result has 305 places, 309 transitions, 1622 flow [2022-01-19 13:22:32,386 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1622, PETRI_PLACES=305, PETRI_TRANSITIONS=309} [2022-01-19 13:22:32,386 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 95 predicate places. [2022-01-19 13:22:32,386 INFO L470 AbstractCegarLoop]: Abstraction has has 305 places, 309 transitions, 1622 flow [2022-01-19 13:22:32,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 203.6) internal successors, (1018), 5 states have internal predecessors, (1018), 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 13:22:32,386 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:32,387 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] [2022-01-19 13:22:32,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:22:32,387 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1391662808, now seen corresponding path program 4 times [2022-01-19 13:22:32,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:32,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474663294] [2022-01-19 13:22:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:32,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:32,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:32,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474663294] [2022-01-19 13:22:32,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474663294] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:32,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928466595] [2022-01-19 13:22:32,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 13:22:32,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:32,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:32,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 13:22:32,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 13:22:32,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:22:32,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:32,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:32,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:33,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928466595] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:33,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:33,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-19 13:22:33,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391395636] [2022-01-19 13:22:33,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:33,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 13:22:33,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 13:22:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-19 13:22:33,004 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:33,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 309 transitions, 1622 flow. Second operand has 11 states, 11 states have (on average 203.36363636363637) internal successors, (2237), 11 states have internal predecessors, (2237), 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 13:22:33,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:33,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:33,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:33,499 INFO L129 PetriNetUnfolder]: 223/3871 cut-off events. [2022-01-19 13:22:33,499 INFO L130 PetriNetUnfolder]: For 2999/3019 co-relation queries the response was YES. [2022-01-19 13:22:33,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 3871 events. 223/3871 cut-off events. For 2999/3019 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 32142 event pairs, 71 based on Foata normal form. 5/3633 useless extension candidates. Maximal degree in co-relation 6358. Up to 154 conditions per place. [2022-01-19 13:22:33,526 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 76 selfloop transitions, 57 changer transitions 1/341 dead transitions. [2022-01-19 13:22:33,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 341 transitions, 2090 flow [2022-01-19 13:22:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:22:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:22:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1865 transitions. [2022-01-19 13:22:33,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2022-01-19 13:22:33,528 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1865 transitions. [2022-01-19 13:22:33,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1865 transitions. [2022-01-19 13:22:33,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:33,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1865 transitions. [2022-01-19 13:22:33,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.22222222222223) internal successors, (1865), 9 states have internal predecessors, (1865), 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 13:22:33,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 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 13:22:33,533 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 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 13:22:33,533 INFO L186 Difference]: Start difference. First operand has 305 places, 309 transitions, 1622 flow. Second operand 9 states and 1865 transitions. [2022-01-19 13:22:33,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 341 transitions, 2090 flow [2022-01-19 13:22:33,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 341 transitions, 2012 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-01-19 13:22:33,548 INFO L242 Difference]: Finished difference. Result has 312 places, 321 transitions, 1853 flow [2022-01-19 13:22:33,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1853, PETRI_PLACES=312, PETRI_TRANSITIONS=321} [2022-01-19 13:22:33,549 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 102 predicate places. [2022-01-19 13:22:33,549 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 321 transitions, 1853 flow [2022-01-19 13:22:33,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.36363636363637) internal successors, (2237), 11 states have internal predecessors, (2237), 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 13:22:33,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:33,549 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] [2022-01-19 13:22:33,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 13:22:33,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:33,767 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1061911468, now seen corresponding path program 4 times [2022-01-19 13:22:33,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:33,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188055215] [2022-01-19 13:22:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:33,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:33,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:33,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188055215] [2022-01-19 13:22:33,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188055215] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:33,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931165478] [2022-01-19 13:22:33,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 13:22:33,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:33,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:33,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:33,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 13:22:33,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 13:22:33,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:22:33,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:33,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:34,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:34,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931165478] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:34,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:34,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-19 13:22:34,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472855625] [2022-01-19 13:22:34,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:34,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 13:22:34,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 13:22:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-19 13:22:34,449 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:34,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 321 transitions, 1853 flow. Second operand has 11 states, 11 states have (on average 203.45454545454547) internal successors, (2238), 11 states have internal predecessors, (2238), 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 13:22:34,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:34,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:34,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:35,030 INFO L129 PetriNetUnfolder]: 291/4931 cut-off events. [2022-01-19 13:22:35,031 INFO L130 PetriNetUnfolder]: For 4071/4108 co-relation queries the response was YES. [2022-01-19 13:22:35,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8165 conditions, 4931 events. 291/4931 cut-off events. For 4071/4108 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 45251 event pairs, 69 based on Foata normal form. 7/4620 useless extension candidates. Maximal degree in co-relation 8111. Up to 134 conditions per place. [2022-01-19 13:22:35,060 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 85 selfloop transitions, 81 changer transitions 0/373 dead transitions. [2022-01-19 13:22:35,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 373 transitions, 2490 flow [2022-01-19 13:22:35,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2688 transitions. [2022-01-19 13:22:35,062 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8989966555183947 [2022-01-19 13:22:35,062 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2688 transitions. [2022-01-19 13:22:35,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2688 transitions. [2022-01-19 13:22:35,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:35,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2688 transitions. [2022-01-19 13:22:35,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 206.76923076923077) internal successors, (2688), 13 states have internal predecessors, (2688), 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 13:22:35,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:35,068 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:35,068 INFO L186 Difference]: Start difference. First operand has 312 places, 321 transitions, 1853 flow. Second operand 13 states and 2688 transitions. [2022-01-19 13:22:35,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 373 transitions, 2490 flow [2022-01-19 13:22:35,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 373 transitions, 2302 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-01-19 13:22:35,086 INFO L242 Difference]: Finished difference. Result has 320 places, 341 transitions, 2109 flow [2022-01-19 13:22:35,087 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2109, PETRI_PLACES=320, PETRI_TRANSITIONS=341} [2022-01-19 13:22:35,087 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 110 predicate places. [2022-01-19 13:22:35,087 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 341 transitions, 2109 flow [2022-01-19 13:22:35,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.45454545454547) internal successors, (2238), 11 states have internal predecessors, (2238), 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 13:22:35,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:35,088 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] [2022-01-19 13:22:35,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 13:22:35,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:35,302 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -753398586, now seen corresponding path program 5 times [2022-01-19 13:22:35,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:35,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776637278] [2022-01-19 13:22:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:35,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:35,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:35,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776637278] [2022-01-19 13:22:35,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776637278] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:35,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62975252] [2022-01-19 13:22:35,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 13:22:35,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:35,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:35,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:35,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 13:22:35,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:22:35,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:22:35,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:35,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:36,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62975252] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:36,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:36,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-19 13:22:36,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058364180] [2022-01-19 13:22:36,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:36,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 13:22:36,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 13:22:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-19 13:22:36,040 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:36,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 341 transitions, 2109 flow. Second operand has 11 states, 11 states have (on average 203.36363636363637) internal successors, (2237), 11 states have internal predecessors, (2237), 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 13:22:36,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:36,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:36,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:36,646 INFO L129 PetriNetUnfolder]: 272/5111 cut-off events. [2022-01-19 13:22:36,646 INFO L130 PetriNetUnfolder]: For 4323/4365 co-relation queries the response was YES. [2022-01-19 13:22:36,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8384 conditions, 5111 events. 272/5111 cut-off events. For 4323/4365 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 47965 event pairs, 99 based on Foata normal form. 8/4782 useless extension candidates. Maximal degree in co-relation 8333. Up to 157 conditions per place. [2022-01-19 13:22:36,680 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 81 selfloop transitions, 86 changer transitions 5/371 dead transitions. [2022-01-19 13:22:36,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 371 transitions, 2592 flow [2022-01-19 13:22:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 13:22:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 13:22:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2684 transitions. [2022-01-19 13:22:36,696 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8976588628762542 [2022-01-19 13:22:36,696 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2684 transitions. [2022-01-19 13:22:36,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2684 transitions. [2022-01-19 13:22:36,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:36,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2684 transitions. [2022-01-19 13:22:36,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 206.46153846153845) internal successors, (2684), 13 states have internal predecessors, (2684), 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 13:22:36,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:36,719 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 230.0) internal successors, (3220), 14 states have internal predecessors, (3220), 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 13:22:36,719 INFO L186 Difference]: Start difference. First operand has 320 places, 341 transitions, 2109 flow. Second operand 13 states and 2684 transitions. [2022-01-19 13:22:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 371 transitions, 2592 flow [2022-01-19 13:22:36,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 371 transitions, 2558 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 13:22:36,750 INFO L242 Difference]: Finished difference. Result has 326 places, 339 transitions, 2251 flow [2022-01-19 13:22:36,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2251, PETRI_PLACES=326, PETRI_TRANSITIONS=339} [2022-01-19 13:22:36,750 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 116 predicate places. [2022-01-19 13:22:36,751 INFO L470 AbstractCegarLoop]: Abstraction has has 326 places, 339 transitions, 2251 flow [2022-01-19 13:22:36,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.36363636363637) internal successors, (2237), 11 states have internal predecessors, (2237), 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 13:22:36,751 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:36,751 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] [2022-01-19 13:22:36,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 13:22:36,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-19 13:22:36,952 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -977035420, now seen corresponding path program 1 times [2022-01-19 13:22:36,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013580998] [2022-01-19 13:22:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:36,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:37,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:37,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013580998] [2022-01-19 13:22:37,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013580998] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:37,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421371961] [2022-01-19 13:22:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:37,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:37,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 13:22:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:37,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:22:37,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:37,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:37,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421371961] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:37,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:37,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-01-19 13:22:37,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649827469] [2022-01-19 13:22:37,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:37,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 13:22:37,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 13:22:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-19 13:22:37,550 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230 [2022-01-19 13:22:37,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 339 transitions, 2251 flow. Second operand has 11 states, 11 states have (on average 203.54545454545453) internal successors, (2239), 11 states have internal predecessors, (2239), 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 13:22:37,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:37,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230 [2022-01-19 13:22:37,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:38,141 INFO L129 PetriNetUnfolder]: 259/4776 cut-off events. [2022-01-19 13:22:38,142 INFO L130 PetriNetUnfolder]: For 4567/4602 co-relation queries the response was YES. [2022-01-19 13:22:38,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7845 conditions, 4776 events. 259/4776 cut-off events. For 4567/4602 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 43724 event pairs, 73 based on Foata normal form. 6/4466 useless extension candidates. Maximal degree in co-relation 7794. Up to 204 conditions per place. [2022-01-19 13:22:38,173 INFO L132 encePairwiseOnDemand]: 222/230 looper letters, 92 selfloop transitions, 65 changer transitions 1/357 dead transitions. [2022-01-19 13:22:38,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 357 transitions, 2642 flow [2022-01-19 13:22:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:22:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:22:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1865 transitions. [2022-01-19 13:22:38,177 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2022-01-19 13:22:38,177 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1865 transitions. [2022-01-19 13:22:38,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1865 transitions. [2022-01-19 13:22:38,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:38,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1865 transitions. [2022-01-19 13:22:38,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.22222222222223) internal successors, (1865), 9 states have internal predecessors, (1865), 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 13:22:38,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 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 13:22:38,180 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 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 13:22:38,180 INFO L186 Difference]: Start difference. First operand has 326 places, 339 transitions, 2251 flow. Second operand 9 states and 1865 transitions. [2022-01-19 13:22:38,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 357 transitions, 2642 flow [2022-01-19 13:22:38,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 357 transitions, 2497 flow, removed 8 selfloop flow, removed 11 redundant places. [2022-01-19 13:22:38,196 INFO L242 Difference]: Finished difference. Result has 322 places, 339 transitions, 2255 flow [2022-01-19 13:22:38,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2255, PETRI_PLACES=322, PETRI_TRANSITIONS=339} [2022-01-19 13:22:38,197 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 112 predicate places. [2022-01-19 13:22:38,197 INFO L470 AbstractCegarLoop]: Abstraction has has 322 places, 339 transitions, 2255 flow [2022-01-19 13:22:38,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.54545454545453) internal successors, (2239), 11 states have internal predecessors, (2239), 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 13:22:38,197 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:38,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:22:38,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 13:22:38,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-19 13:22:38,414 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1494837026, now seen corresponding path program 1 times [2022-01-19 13:22:38,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881807842] [2022-01-19 13:22:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:38,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:38,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881807842] [2022-01-19 13:22:38,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881807842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892965220] [2022-01-19 13:22:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:38,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:38,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:38,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:38,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 13:22:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:38,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:22:38,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:39,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:39,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892965220] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:39,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:39,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2022-01-19 13:22:39,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907835151] [2022-01-19 13:22:39,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:39,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 13:22:39,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:39,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 13:22:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2022-01-19 13:22:39,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:22:39,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 339 transitions, 2255 flow. Second operand has 39 states, 39 states have (on average 165.53846153846155) internal successors, (6456), 39 states have internal predecessors, (6456), 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 13:22:39,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:39,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:22:39,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:22:48,863 INFO L129 PetriNetUnfolder]: 6459/38061 cut-off events. [2022-01-19 13:22:48,863 INFO L130 PetriNetUnfolder]: For 25612/25752 co-relation queries the response was YES. [2022-01-19 13:22:49,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67521 conditions, 38061 events. 6459/38061 cut-off events. For 25612/25752 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 516780 event pairs, 960 based on Foata normal form. 36/36036 useless extension candidates. Maximal degree in co-relation 67476. Up to 5697 conditions per place. [2022-01-19 13:22:49,208 INFO L132 encePairwiseOnDemand]: 199/230 looper letters, 580 selfloop transitions, 228 changer transitions 9/1098 dead transitions. [2022-01-19 13:22:49,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1098 transitions, 5836 flow [2022-01-19 13:22:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-01-19 13:22:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2022-01-19 13:22:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 21840 transitions. [2022-01-19 13:22:49,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7360970677451971 [2022-01-19 13:22:49,224 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 21840 transitions. [2022-01-19 13:22:49,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 21840 transitions. [2022-01-19 13:22:49,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:22:49,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 21840 transitions. [2022-01-19 13:22:49,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 169.30232558139534) internal successors, (21840), 129 states have internal predecessors, (21840), 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 13:22:49,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 230.0) internal successors, (29900), 130 states have internal predecessors, (29900), 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 13:22:49,274 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 230.0) internal successors, (29900), 130 states have internal predecessors, (29900), 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 13:22:49,274 INFO L186 Difference]: Start difference. First operand has 322 places, 339 transitions, 2255 flow. Second operand 129 states and 21840 transitions. [2022-01-19 13:22:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 1098 transitions, 5836 flow [2022-01-19 13:22:49,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1098 transitions, 5640 flow, removed 13 selfloop flow, removed 11 redundant places. [2022-01-19 13:22:49,524 INFO L242 Difference]: Finished difference. Result has 525 places, 578 transitions, 3862 flow [2022-01-19 13:22:49,524 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=3862, PETRI_PLACES=525, PETRI_TRANSITIONS=578} [2022-01-19 13:22:49,524 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 315 predicate places. [2022-01-19 13:22:49,525 INFO L470 AbstractCegarLoop]: Abstraction has has 525 places, 578 transitions, 3862 flow [2022-01-19 13:22:49,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 165.53846153846155) internal successors, (6456), 39 states have internal predecessors, (6456), 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 13:22:49,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:22:49,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:22:49,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 13:22:49,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:49,728 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:22:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:22:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash -375783344, now seen corresponding path program 1 times [2022-01-19 13:22:49,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:22:49,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190268206] [2022-01-19 13:22:49,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:49,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:22:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:50,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:22:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190268206] [2022-01-19 13:22:50,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190268206] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:22:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54002165] [2022-01-19 13:22:50,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:22:50,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:22:50,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:22:50,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:22:50,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 13:22:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:22:50,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:22:50,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:22:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:50,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:22:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:22:51,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54002165] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:22:51,224 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:22:51,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2022-01-19 13:22:51,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421173579] [2022-01-19 13:22:51,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:22:51,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 13:22:51,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:22:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 13:22:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 13:22:51,228 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:22:51,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 578 transitions, 3862 flow. Second operand has 40 states, 40 states have (on average 165.55) internal successors, (6622), 40 states have internal predecessors, (6622), 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 13:22:51,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:22:51,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:22:51,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:23:06,304 INFO L129 PetriNetUnfolder]: 8719/51253 cut-off events. [2022-01-19 13:23:06,305 INFO L130 PetriNetUnfolder]: For 304230/305177 co-relation queries the response was YES. [2022-01-19 13:23:07,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145236 conditions, 51253 events. 8719/51253 cut-off events. For 304230/305177 co-relation queries the response was YES. Maximal size of possible extension queue 1057. Compared 732770 event pairs, 1733 based on Foata normal form. 285/48574 useless extension candidates. Maximal degree in co-relation 145111. Up to 9176 conditions per place. [2022-01-19 13:23:07,404 INFO L132 encePairwiseOnDemand]: 201/230 looper letters, 607 selfloop transitions, 290 changer transitions 8/1186 dead transitions. [2022-01-19 13:23:07,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 1186 transitions, 10485 flow [2022-01-19 13:23:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-19 13:23:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-01-19 13:23:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 11843 transitions. [2022-01-19 13:23:07,439 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7462507876496535 [2022-01-19 13:23:07,439 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 11843 transitions. [2022-01-19 13:23:07,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 11843 transitions. [2022-01-19 13:23:07,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:23:07,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 11843 transitions. [2022-01-19 13:23:07,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 171.63768115942028) internal successors, (11843), 69 states have internal predecessors, (11843), 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 13:23:07,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 230.0) internal successors, (16100), 70 states have internal predecessors, (16100), 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 13:23:07,477 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 230.0) internal successors, (16100), 70 states have internal predecessors, (16100), 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 13:23:07,477 INFO L186 Difference]: Start difference. First operand has 525 places, 578 transitions, 3862 flow. Second operand 69 states and 11843 transitions. [2022-01-19 13:23:07,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 1186 transitions, 10485 flow [2022-01-19 13:23:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 1186 transitions, 10048 flow, removed 139 selfloop flow, removed 9 redundant places. [2022-01-19 13:23:09,212 INFO L242 Difference]: Finished difference. Result has 629 places, 782 transitions, 6608 flow [2022-01-19 13:23:09,212 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=3615, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=6608, PETRI_PLACES=629, PETRI_TRANSITIONS=782} [2022-01-19 13:23:09,214 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 419 predicate places. [2022-01-19 13:23:09,214 INFO L470 AbstractCegarLoop]: Abstraction has has 629 places, 782 transitions, 6608 flow [2022-01-19 13:23:09,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 165.55) internal successors, (6622), 40 states have internal predecessors, (6622), 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 13:23:09,215 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:23:09,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:23:09,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 13:23:09,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-19 13:23:09,437 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:23:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:23:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1734420654, now seen corresponding path program 2 times [2022-01-19 13:23:09,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:23:09,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098597189] [2022-01-19 13:23:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:23:09,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:23:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:23:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:09,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:23:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098597189] [2022-01-19 13:23:09,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098597189] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:23:09,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496267820] [2022-01-19 13:23:09,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:23:09,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:23:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:23:09,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:23:09,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 13:23:09,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:23:09,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:23:09,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:23:09,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:23:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:10,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:23:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:10,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496267820] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:23:10,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:23:10,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 41 [2022-01-19 13:23:10,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060190913] [2022-01-19 13:23:10,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:23:10,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 13:23:10,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:23:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 13:23:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2022-01-19 13:23:10,917 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:23:10,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 782 transitions, 6608 flow. Second operand has 41 states, 41 states have (on average 165.5121951219512) internal successors, (6786), 41 states have internal predecessors, (6786), 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 13:23:10,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:23:10,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:23:10,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:23:33,137 INFO L129 PetriNetUnfolder]: 11472/69941 cut-off events. [2022-01-19 13:23:33,137 INFO L130 PetriNetUnfolder]: For 575006/576768 co-relation queries the response was YES. [2022-01-19 13:23:34,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215764 conditions, 69941 events. 11472/69941 cut-off events. For 575006/576768 co-relation queries the response was YES. Maximal size of possible extension queue 1429. Compared 1063397 event pairs, 2363 based on Foata normal form. 638/66477 useless extension candidates. Maximal degree in co-relation 215598. Up to 10423 conditions per place. [2022-01-19 13:23:35,148 INFO L132 encePairwiseOnDemand]: 203/230 looper letters, 868 selfloop transitions, 329 changer transitions 11/1489 dead transitions. [2022-01-19 13:23:35,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 1489 transitions, 17221 flow [2022-01-19 13:23:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 13:23:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 13:23:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 12711 transitions. [2022-01-19 13:23:35,158 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7468272620446533 [2022-01-19 13:23:35,158 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 12711 transitions. [2022-01-19 13:23:35,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 12711 transitions. [2022-01-19 13:23:35,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:23:35,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 12711 transitions. [2022-01-19 13:23:35,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 171.77027027027026) internal successors, (12711), 74 states have internal predecessors, (12711), 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 13:23:35,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 230.0) internal successors, (17250), 75 states have internal predecessors, (17250), 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 13:23:35,189 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 230.0) internal successors, (17250), 75 states have internal predecessors, (17250), 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 13:23:35,189 INFO L186 Difference]: Start difference. First operand has 629 places, 782 transitions, 6608 flow. Second operand 74 states and 12711 transitions. [2022-01-19 13:23:35,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 1489 transitions, 17221 flow [2022-01-19 13:23:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 1489 transitions, 15185 flow, removed 978 selfloop flow, removed 8 redundant places. [2022-01-19 13:23:40,211 INFO L242 Difference]: Finished difference. Result has 731 places, 1005 transitions, 9286 flow [2022-01-19 13:23:40,211 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5864, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=9286, PETRI_PLACES=731, PETRI_TRANSITIONS=1005} [2022-01-19 13:23:40,212 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 521 predicate places. [2022-01-19 13:23:40,212 INFO L470 AbstractCegarLoop]: Abstraction has has 731 places, 1005 transitions, 9286 flow [2022-01-19 13:23:40,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 165.5121951219512) internal successors, (6786), 41 states have internal predecessors, (6786), 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 13:23:40,213 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:23:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:23:40,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-19 13:23:40,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:23:40,421 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:23:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:23:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 134580740, now seen corresponding path program 3 times [2022-01-19 13:23:40,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:23:40,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544970208] [2022-01-19 13:23:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:23:40,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:23:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:23:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:40,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:23:40,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544970208] [2022-01-19 13:23:40,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544970208] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:23:40,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220051423] [2022-01-19 13:23:40,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 13:23:40,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:23:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:23:40,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:23:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 13:23:40,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 13:23:40,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:23:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:23:40,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:23:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:41,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:23:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:23:41,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220051423] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:23:41,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:23:41,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2022-01-19 13:23:41,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912274023] [2022-01-19 13:23:41,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:23:41,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 13:23:41,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:23:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 13:23:41,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 13:23:41,951 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:23:41,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 1005 transitions, 9286 flow. Second operand has 40 states, 40 states have (on average 165.55) internal successors, (6622), 40 states have internal predecessors, (6622), 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 13:23:41,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:23:41,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:23:41,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:24:11,409 INFO L129 PetriNetUnfolder]: 13083/79912 cut-off events. [2022-01-19 13:24:11,410 INFO L130 PetriNetUnfolder]: For 619531/622107 co-relation queries the response was YES. [2022-01-19 13:24:14,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 247960 conditions, 79912 events. 13083/79912 cut-off events. For 619531/622107 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 1246062 event pairs, 2607 based on Foata normal form. 852/76109 useless extension candidates. Maximal degree in co-relation 247760. Up to 10809 conditions per place. [2022-01-19 13:24:14,739 INFO L132 encePairwiseOnDemand]: 203/230 looper letters, 869 selfloop transitions, 496 changer transitions 10/1656 dead transitions. [2022-01-19 13:24:14,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 805 places, 1656 transitions, 18232 flow [2022-01-19 13:24:14,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-01-19 13:24:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-01-19 13:24:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 12914 transitions. [2022-01-19 13:24:14,747 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7486376811594203 [2022-01-19 13:24:14,747 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 12914 transitions. [2022-01-19 13:24:14,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 12914 transitions. [2022-01-19 13:24:14,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:24:14,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 12914 transitions. [2022-01-19 13:24:14,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 172.18666666666667) internal successors, (12914), 75 states have internal predecessors, (12914), 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 13:24:14,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 230.0) internal successors, (17480), 76 states have internal predecessors, (17480), 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 13:24:14,764 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 230.0) internal successors, (17480), 76 states have internal predecessors, (17480), 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 13:24:14,764 INFO L186 Difference]: Start difference. First operand has 731 places, 1005 transitions, 9286 flow. Second operand 75 states and 12914 transitions. [2022-01-19 13:24:14,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 805 places, 1656 transitions, 18232 flow [2022-01-19 13:24:22,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 793 places, 1656 transitions, 16283 flow, removed 805 selfloop flow, removed 12 redundant places. [2022-01-19 13:24:22,149 INFO L242 Difference]: Finished difference. Result has 822 places, 1184 transitions, 11387 flow [2022-01-19 13:24:22,150 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=8116, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=11387, PETRI_PLACES=822, PETRI_TRANSITIONS=1184} [2022-01-19 13:24:22,150 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 612 predicate places. [2022-01-19 13:24:22,150 INFO L470 AbstractCegarLoop]: Abstraction has has 822 places, 1184 transitions, 11387 flow [2022-01-19 13:24:22,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 165.55) internal successors, (6622), 40 states have internal predecessors, (6622), 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 13:24:22,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:24:22,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:24:22,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 13:24:22,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-01-19 13:24:22,360 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:24:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:24:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1535102482, now seen corresponding path program 4 times [2022-01-19 13:24:22,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:24:22,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466368293] [2022-01-19 13:24:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:24:22,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:24:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:24:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:24:22,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:24:22,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466368293] [2022-01-19 13:24:22,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466368293] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:24:22,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340227775] [2022-01-19 13:24:22,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 13:24:22,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:24:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:24:22,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:24:22,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 13:24:22,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 13:24:22,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:24:22,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:24:22,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:24:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:24:23,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:24:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:24:23,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340227775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:24:23,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:24:23,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 41 [2022-01-19 13:24:23,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722002381] [2022-01-19 13:24:23,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:24:23,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 13:24:23,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:24:23,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 13:24:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2022-01-19 13:24:23,689 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:24:23,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 822 places, 1184 transitions, 11387 flow. Second operand has 41 states, 41 states have (on average 165.5121951219512) internal successors, (6786), 41 states have internal predecessors, (6786), 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 13:24:23,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:24:23,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:24:23,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:24:58,085 INFO L129 PetriNetUnfolder]: 14800/91168 cut-off events. [2022-01-19 13:24:58,085 INFO L130 PetriNetUnfolder]: For 532465/535580 co-relation queries the response was YES. [2022-01-19 13:25:02,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274247 conditions, 91168 events. 14800/91168 cut-off events. For 532465/535580 co-relation queries the response was YES. Maximal size of possible extension queue 2034. Compared 1457397 event pairs, 3184 based on Foata normal form. 1085/86907 useless extension candidates. Maximal degree in co-relation 274023. Up to 13479 conditions per place. [2022-01-19 13:25:02,747 INFO L132 encePairwiseOnDemand]: 203/230 looper letters, 1127 selfloop transitions, 520 changer transitions 13/1941 dead transitions. [2022-01-19 13:25:02,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 1941 transitions, 22323 flow [2022-01-19 13:25:02,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-01-19 13:25:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-01-19 13:25:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 14452 transitions. [2022-01-19 13:25:02,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7480331262939959 [2022-01-19 13:25:02,754 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 14452 transitions. [2022-01-19 13:25:02,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 14452 transitions. [2022-01-19 13:25:02,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:25:02,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 14452 transitions. [2022-01-19 13:25:02,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 172.04761904761904) internal successors, (14452), 84 states have internal predecessors, (14452), 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 13:25:02,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 230.0) internal successors, (19550), 85 states have internal predecessors, (19550), 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 13:25:02,772 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 230.0) internal successors, (19550), 85 states have internal predecessors, (19550), 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 13:25:02,772 INFO L186 Difference]: Start difference. First operand has 822 places, 1184 transitions, 11387 flow. Second operand 84 states and 14452 transitions. [2022-01-19 13:25:02,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 1941 transitions, 22323 flow [2022-01-19 13:25:11,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 891 places, 1941 transitions, 21349 flow, removed 445 selfloop flow, removed 14 redundant places. [2022-01-19 13:25:11,222 INFO L242 Difference]: Finished difference. Result has 923 places, 1364 transitions, 14463 flow [2022-01-19 13:25:11,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=10684, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=363, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=14463, PETRI_PLACES=923, PETRI_TRANSITIONS=1364} [2022-01-19 13:25:11,223 INFO L334 CegarLoopForPetriNet]: 210 programPoint places, 713 predicate places. [2022-01-19 13:25:11,223 INFO L470 AbstractCegarLoop]: Abstraction has has 923 places, 1364 transitions, 14463 flow [2022-01-19 13:25:11,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 165.5121951219512) internal successors, (6786), 41 states have internal predecessors, (6786), 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 13:25:11,223 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:25:11,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:25:11,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 13:25:11,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-19 13:25:11,440 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:25:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:25:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2037437860, now seen corresponding path program 5 times [2022-01-19 13:25:11,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:25:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285500442] [2022-01-19 13:25:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:25:11,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:25:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:25:11,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:25:11,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:25:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285500442] [2022-01-19 13:25:11,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285500442] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:25:11,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136417183] [2022-01-19 13:25:11,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 13:25:11,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:25:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:25:11,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:25:11,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 13:25:11,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-19 13:25:11,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:25:11,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-19 13:25:11,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:25:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:25:12,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:25:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:25:13,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136417183] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:25:13,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:25:13,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-01-19 13:25:13,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691074461] [2022-01-19 13:25:13,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:25:13,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-19 13:25:13,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:25:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-19 13:25:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1594, Unknown=0, NotChecked=0, Total=1722 [2022-01-19 13:25:13,021 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 230 [2022-01-19 13:25:13,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 1364 transitions, 14463 flow. Second operand has 42 states, 42 states have (on average 165.47619047619048) internal successors, (6950), 42 states have internal predecessors, (6950), 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 13:25:13,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:25:13,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 230 [2022-01-19 13:25:13,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand