/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/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:37:43,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:37:43,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:37:44,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:37:44,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:37:44,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:37:44,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:37:44,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:37:44,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:37:44,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:37:44,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:37:44,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:37:44,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:37:44,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:37:44,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:37:44,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:37:44,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:37:44,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:37:44,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:37:44,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:37:44,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:37:44,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:37:44,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:37:44,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:37:44,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:37:44,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:37:44,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:37:44,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:37:44,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:37:44,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:37:44,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:37:44,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:37:44,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:37:44,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:37:44,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:37:44,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:37:44,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:37:44,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:37:44,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:37:44,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:37:44,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:37:44,052 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:37:44,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:37:44,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:37:44,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:37:44,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:37:44,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:37:44,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:37:44,078 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:37:44,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:37:44,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:37:44,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:37:44,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:37:44,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:37:44,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:37:44,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:37:44,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:37:44,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:37:44,081 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:37:44,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:37:44,081 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:37:44,081 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:37:44,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:37:44,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:37:44,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:37:44,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:37:44,294 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:37:44,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2022-01-19 13:37:44,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1298526/b38ab512dd814f4fbab606f875ff3af2/FLAGc0ac6c595 [2022-01-19 13:37:44,665 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:37:44,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2022-01-19 13:37:44,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1298526/b38ab512dd814f4fbab606f875ff3af2/FLAGc0ac6c595 [2022-01-19 13:37:45,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1298526/b38ab512dd814f4fbab606f875ff3af2 [2022-01-19 13:37:45,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:37:45,119 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:37:45,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:37:45,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:37:45,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:37:45,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b1c701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45, skipping insertion in model container [2022-01-19 13:37:45,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:37:45,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:37:45,270 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/parallel-misc-4.wvr.c[2950,2963] [2022-01-19 13:37:45,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:37:45,277 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:37:45,289 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/parallel-misc-4.wvr.c[2950,2963] [2022-01-19 13:37:45,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:37:45,298 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:37:45,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45 WrapperNode [2022-01-19 13:37:45,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:37:45,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:37:45,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:37:45,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:37:45,304 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:37:45" (1/1) ... [2022-01-19 13:37:45,308 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:37:45" (1/1) ... [2022-01-19 13:37:45,325 INFO L137 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-01-19 13:37:45,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:37:45,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:37:45,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:37:45,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:37:45,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:37:45,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:37:45,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:37:45,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:37:45,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (1/1) ... [2022-01-19 13:37:45,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:37:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:37:45,362 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:37:45,374 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:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:37:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:37:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:37:45,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:37:45,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:37:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 13:37:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 13:37:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:37:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:37:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:37:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:37:45,391 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:37:45,440 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:37:45,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:37:45,610 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:37:45,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:37:45,630 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 13:37:45,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:37:45 BoogieIcfgContainer [2022-01-19 13:37:45,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:37:45,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:37:45,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:37:45,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:37:45,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:37:45" (1/3) ... [2022-01-19 13:37:45,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb38c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:37:45, skipping insertion in model container [2022-01-19 13:37:45,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:37:45" (2/3) ... [2022-01-19 13:37:45,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb38c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:37:45, skipping insertion in model container [2022-01-19 13:37:45,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:37:45" (3/3) ... [2022-01-19 13:37:45,643 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2022-01-19 13:37:45,646 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:37:45,646 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:37:45,646 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:37:45,685 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,685 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,685 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,686 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,689 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,690 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,691 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,692 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,692 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,692 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,693 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,693 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,693 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,693 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,695 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,695 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,695 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,696 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:37:45,699 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 13:37:45,728 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:37:45,732 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:37:45,732 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 13:37:45,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2022-01-19 13:37:45,771 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2022-01-19 13:37:45,771 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:37:45,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-01-19 13:37:45,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2022-01-19 13:37:45,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 200 flow [2022-01-19 13:37:45,791 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2022-01-19 13:37:45,791 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:37:45,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:45,792 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] [2022-01-19 13:37:45,792 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash 237529111, now seen corresponding path program 1 times [2022-01-19 13:37:45,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:45,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761261701] [2022-01-19 13:37:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:45,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:45,937 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:37:45,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:45,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761261701] [2022-01-19 13:37:45,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761261701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:45,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:45,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 13:37:45,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373818249] [2022-01-19 13:37:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:45,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 13:37:45,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 13:37:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 13:37:45,967 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2022-01-19 13:37:45,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:37:45,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:45,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2022-01-19 13:37:45,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:45,998 INFO L129 PetriNetUnfolder]: 13/115 cut-off events. [2022-01-19 13:37:45,999 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-01-19 13:37:46,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 115 events. 13/115 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 2 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 100. Up to 20 conditions per place. [2022-01-19 13:37:46,001 INFO L132 encePairwiseOnDemand]: 102/105 looper letters, 8 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2022-01-19 13:37:46,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 210 flow [2022-01-19 13:37:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 13:37:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 13:37:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2022-01-19 13:37:46,012 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-01-19 13:37:46,014 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2022-01-19 13:37:46,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2022-01-19 13:37:46,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:46,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2022-01-19 13:37:46,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have 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:37:46,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:37:46,031 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:37:46,033 INFO L186 Difference]: Start difference. First operand has 94 places, 91 transitions, 200 flow. Second operand 2 states and 197 transitions. [2022-01-19 13:37:46,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 210 flow [2022-01-19 13:37:46,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 13:37:46,040 INFO L242 Difference]: Finished difference. Result has 89 places, 87 transitions, 180 flow [2022-01-19 13:37:46,041 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2022-01-19 13:37:46,043 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, -5 predicate places. [2022-01-19 13:37:46,044 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 180 flow [2022-01-19 13:37:46,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:37:46,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:46,044 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] [2022-01-19 13:37:46,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:37:46,044 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -771818347, now seen corresponding path program 1 times [2022-01-19 13:37:46,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:46,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364455938] [2022-01-19 13:37:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:46,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:46,256 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:37:46,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364455938] [2022-01-19 13:37:46,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364455938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:46,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:46,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:37:46,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231040429] [2022-01-19 13:37:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:46,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:37:46,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:37:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:37:46,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-01-19 13:37:46,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:37:46,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:46,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-01-19 13:37:46,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:46,417 INFO L129 PetriNetUnfolder]: 79/268 cut-off events. [2022-01-19 13:37:46,417 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 13:37:46,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 268 events. 79/268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 949 event pairs, 9 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 402. Up to 53 conditions per place. [2022-01-19 13:37:46,422 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 30 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2022-01-19 13:37:46,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 285 flow [2022-01-19 13:37:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:37:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:37:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2022-01-19 13:37:46,427 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2022-01-19 13:37:46,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2022-01-19 13:37:46,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2022-01-19 13:37:46,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:46,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2022-01-19 13:37:46,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have 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:37:46,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:37:46,432 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:37:46,432 INFO L186 Difference]: Start difference. First operand has 89 places, 87 transitions, 180 flow. Second operand 6 states and 511 transitions. [2022-01-19 13:37:46,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 285 flow [2022-01-19 13:37:46,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:37:46,435 INFO L242 Difference]: Finished difference. Result has 95 places, 89 transitions, 205 flow [2022-01-19 13:37:46,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2022-01-19 13:37:46,436 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2022-01-19 13:37:46,436 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 205 flow [2022-01-19 13:37:46,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:37:46,437 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:46,437 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] [2022-01-19 13:37:46,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:37:46,438 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1417648341, now seen corresponding path program 2 times [2022-01-19 13:37:46,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:46,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702006963] [2022-01-19 13:37:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:46,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:46,636 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:37:46,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:46,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702006963] [2022-01-19 13:37:46,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702006963] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:46,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:46,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:37:46,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454735151] [2022-01-19 13:37:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:46,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:37:46,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:37:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:37:46,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-01-19 13:37:46,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:37:46,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:46,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-01-19 13:37:46,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:46,742 INFO L129 PetriNetUnfolder]: 64/245 cut-off events. [2022-01-19 13:37:46,742 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-01-19 13:37:46,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 245 events. 64/245 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 838 event pairs, 12 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 399. Up to 46 conditions per place. [2022-01-19 13:37:46,744 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 27 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2022-01-19 13:37:46,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 311 flow [2022-01-19 13:37:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:37:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:37:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2022-01-19 13:37:46,746 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2022-01-19 13:37:46,746 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2022-01-19 13:37:46,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2022-01-19 13:37:46,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:46,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2022-01-19 13:37:46,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:37:46,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:37:46,749 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have 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:37:46,749 INFO L186 Difference]: Start difference. First operand has 95 places, 89 transitions, 205 flow. Second operand 6 states and 508 transitions. [2022-01-19 13:37:46,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 311 flow [2022-01-19 13:37:46,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:37:46,754 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 235 flow [2022-01-19 13:37:46,754 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-01-19 13:37:46,755 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2022-01-19 13:37:46,756 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 235 flow [2022-01-19 13:37:46,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have 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:37:46,756 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:46,756 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:37:46,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:37:46,756 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash 411281951, now seen corresponding path program 3 times [2022-01-19 13:37:46,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915512531] [2022-01-19 13:37:46,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:46,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:46,939 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:37:46,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:46,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915512531] [2022-01-19 13:37:46,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915512531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:46,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:46,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:37:46,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882665031] [2022-01-19 13:37:46,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:46,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:37:46,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:37:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:37:46,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-01-19 13:37:46,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:37:46,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:46,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-01-19 13:37:46,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:47,036 INFO L129 PetriNetUnfolder]: 60/211 cut-off events. [2022-01-19 13:37:47,036 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-01-19 13:37:47,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 211 events. 60/211 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 621 event pairs, 1 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 393. Up to 46 conditions per place. [2022-01-19 13:37:47,038 INFO L132 encePairwiseOnDemand]: 97/105 looper letters, 28 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-01-19 13:37:47,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 343 flow [2022-01-19 13:37:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:37:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:37:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2022-01-19 13:37:47,039 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2022-01-19 13:37:47,039 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2022-01-19 13:37:47,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2022-01-19 13:37:47,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:47,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2022-01-19 13:37:47,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have 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:37:47,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:37:47,042 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:37:47,042 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 235 flow. Second operand 7 states and 590 transitions. [2022-01-19 13:37:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 104 transitions, 343 flow [2022-01-19 13:37:47,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:37:47,045 INFO L242 Difference]: Finished difference. Result has 104 places, 94 transitions, 265 flow [2022-01-19 13:37:47,046 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2022-01-19 13:37:47,047 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2022-01-19 13:37:47,047 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 265 flow [2022-01-19 13:37:47,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have 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:37:47,048 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:47,048 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:37:47,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:37:47,048 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1786478961, now seen corresponding path program 4 times [2022-01-19 13:37:47,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:47,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342231577] [2022-01-19 13:37:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:47,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:47,170 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:37:47,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342231577] [2022-01-19 13:37:47,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342231577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:47,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:47,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:37:47,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109053217] [2022-01-19 13:37:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:47,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:37:47,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:37:47,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:37:47,172 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-01-19 13:37:47,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have 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:37:47,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:47,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-01-19 13:37:47,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:47,326 INFO L129 PetriNetUnfolder]: 224/620 cut-off events. [2022-01-19 13:37:47,327 INFO L130 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2022-01-19 13:37:47,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 620 events. 224/620 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3300 event pairs, 41 based on Foata normal form. 6/574 useless extension candidates. Maximal degree in co-relation 1258. Up to 157 conditions per place. [2022-01-19 13:37:47,331 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 35 selfloop transitions, 7 changer transitions 38/142 dead transitions. [2022-01-19 13:37:47,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 598 flow [2022-01-19 13:37:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:37:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:37:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2022-01-19 13:37:47,333 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2022-01-19 13:37:47,333 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2022-01-19 13:37:47,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2022-01-19 13:37:47,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:47,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2022-01-19 13:37:47,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have 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:37:47,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:47,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:47,336 INFO L186 Difference]: Start difference. First operand has 104 places, 94 transitions, 265 flow. Second operand 9 states and 748 transitions. [2022-01-19 13:37:47,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 598 flow [2022-01-19 13:37:47,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 582 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 13:37:47,339 INFO L242 Difference]: Finished difference. Result has 113 places, 95 transitions, 299 flow [2022-01-19 13:37:47,340 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2022-01-19 13:37:47,340 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2022-01-19 13:37:47,340 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 299 flow [2022-01-19 13:37:47,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have 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:37:47,341 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:47,341 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] [2022-01-19 13:37:47,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:37:47,341 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:47,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2074634458, now seen corresponding path program 1 times [2022-01-19 13:37:47,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485524854] [2022-01-19 13:37:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:47,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:47,407 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:37:47,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:47,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485524854] [2022-01-19 13:37:47,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485524854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:47,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:47,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:37:47,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409702249] [2022-01-19 13:37:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:47,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:37:47,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:47,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:37:47,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:37:47,409 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-01-19 13:37:47,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:47,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:47,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-01-19 13:37:47,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:47,524 INFO L129 PetriNetUnfolder]: 242/632 cut-off events. [2022-01-19 13:37:47,525 INFO L130 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2022-01-19 13:37:47,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 632 events. 242/632 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3194 event pairs, 5 based on Foata normal form. 15/592 useless extension candidates. Maximal degree in co-relation 1509. Up to 125 conditions per place. [2022-01-19 13:37:47,530 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 51 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2022-01-19 13:37:47,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 684 flow [2022-01-19 13:37:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:37:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:37:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-01-19 13:37:47,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2022-01-19 13:37:47,531 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2022-01-19 13:37:47,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2022-01-19 13:37:47,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:47,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2022-01-19 13:37:47,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have 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:37:47,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:37:47,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have 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:37:47,534 INFO L186 Difference]: Start difference. First operand has 113 places, 95 transitions, 299 flow. Second operand 7 states and 632 transitions. [2022-01-19 13:37:47,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 684 flow [2022-01-19 13:37:47,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 658 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-01-19 13:37:47,539 INFO L242 Difference]: Finished difference. Result has 116 places, 113 transitions, 504 flow [2022-01-19 13:37:47,539 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2022-01-19 13:37:47,539 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2022-01-19 13:37:47,539 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 504 flow [2022-01-19 13:37:47,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:47,540 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:47,540 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] [2022-01-19 13:37:47,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:37:47,540 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1048037250, now seen corresponding path program 2 times [2022-01-19 13:37:47,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:47,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895688736] [2022-01-19 13:37:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:47,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:47,616 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:37:47,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895688736] [2022-01-19 13:37:47,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895688736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:47,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:47,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:37:47,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212622638] [2022-01-19 13:37:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:47,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:37:47,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:37:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:37:47,620 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-01-19 13:37:47,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:47,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:47,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-01-19 13:37:47,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:47,795 INFO L129 PetriNetUnfolder]: 414/1064 cut-off events. [2022-01-19 13:37:47,795 INFO L130 PetriNetUnfolder]: For 2505/2507 co-relation queries the response was YES. [2022-01-19 13:37:47,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1064 events. 414/1064 cut-off events. For 2505/2507 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6429 event pairs, 3 based on Foata normal form. 12/985 useless extension candidates. Maximal degree in co-relation 3257. Up to 173 conditions per place. [2022-01-19 13:37:47,805 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 82 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2022-01-19 13:37:47,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 194 transitions, 1355 flow [2022-01-19 13:37:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:37:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:37:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 812 transitions. [2022-01-19 13:37:47,807 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2022-01-19 13:37:47,807 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 812 transitions. [2022-01-19 13:37:47,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 812 transitions. [2022-01-19 13:37:47,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:47,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 812 transitions. [2022-01-19 13:37:47,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:37:47,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:47,810 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:47,810 INFO L186 Difference]: Start difference. First operand has 116 places, 113 transitions, 504 flow. Second operand 9 states and 812 transitions. [2022-01-19 13:37:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 194 transitions, 1355 flow [2022-01-19 13:37:47,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 194 transitions, 1355 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:37:47,818 INFO L242 Difference]: Finished difference. Result has 130 places, 141 transitions, 960 flow [2022-01-19 13:37:47,819 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=130, PETRI_TRANSITIONS=141} [2022-01-19 13:37:47,819 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2022-01-19 13:37:47,819 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 141 transitions, 960 flow [2022-01-19 13:37:47,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:47,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:47,820 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] [2022-01-19 13:37:47,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:37:47,820 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1733351978, now seen corresponding path program 3 times [2022-01-19 13:37:47,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796340412] [2022-01-19 13:37:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:47,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:47,879 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:37:47,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796340412] [2022-01-19 13:37:47,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796340412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:47,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:47,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:37:47,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939324856] [2022-01-19 13:37:47,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:47,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:37:47,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:47,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:37:47,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:37:47,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-01-19 13:37:47,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 141 transitions, 960 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:47,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:47,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-01-19 13:37:47,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:48,184 INFO L129 PetriNetUnfolder]: 770/1833 cut-off events. [2022-01-19 13:37:48,184 INFO L130 PetriNetUnfolder]: For 9138/9195 co-relation queries the response was YES. [2022-01-19 13:37:48,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7206 conditions, 1833 events. 770/1833 cut-off events. For 9138/9195 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12727 event pairs, 46 based on Foata normal form. 35/1726 useless extension candidates. Maximal degree in co-relation 7181. Up to 453 conditions per place. [2022-01-19 13:37:48,203 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 113 selfloop transitions, 75 changer transitions 30/286 dead transitions. [2022-01-19 13:37:48,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 286 transitions, 2973 flow [2022-01-19 13:37:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:37:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:37:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2022-01-19 13:37:48,206 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-01-19 13:37:48,206 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 810 transitions. [2022-01-19 13:37:48,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 810 transitions. [2022-01-19 13:37:48,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:48,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 810 transitions. [2022-01-19 13:37:48,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have 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:37:48,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:48,210 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have 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:37:48,210 INFO L186 Difference]: Start difference. First operand has 130 places, 141 transitions, 960 flow. Second operand 9 states and 810 transitions. [2022-01-19 13:37:48,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 286 transitions, 2973 flow [2022-01-19 13:37:48,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 286 transitions, 2933 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-01-19 13:37:48,236 INFO L242 Difference]: Finished difference. Result has 146 places, 193 transitions, 1992 flow [2022-01-19 13:37:48,236 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1992, PETRI_PLACES=146, PETRI_TRANSITIONS=193} [2022-01-19 13:37:48,238 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 52 predicate places. [2022-01-19 13:37:48,238 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 193 transitions, 1992 flow [2022-01-19 13:37:48,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have 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:37:48,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:48,239 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] [2022-01-19 13:37:48,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:37:48,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 266266506, now seen corresponding path program 4 times [2022-01-19 13:37:48,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:48,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675976957] [2022-01-19 13:37:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:48,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:48,304 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:37:48,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675976957] [2022-01-19 13:37:48,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675976957] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:48,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:48,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:37:48,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685622319] [2022-01-19 13:37:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:48,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:37:48,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:37:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:37:48,306 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-01-19 13:37:48,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 193 transitions, 1992 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have 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:37:48,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:48,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-01-19 13:37:48,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:48,409 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 25#L110-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,409 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-01-19 13:37:48,409 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-01-19 13:37:48,409 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-01-19 13:37:48,409 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-01-19 13:37:48,501 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][117], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,502 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, 73#thread3ENTRYtrue, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 5#L111-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,502 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-01-19 13:37:48,502 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 13:37:48,552 INFO L129 PetriNetUnfolder]: 514/1577 cut-off events. [2022-01-19 13:37:48,552 INFO L130 PetriNetUnfolder]: For 11095/11792 co-relation queries the response was YES. [2022-01-19 13:37:48,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 1577 events. 514/1577 cut-off events. For 11095/11792 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12409 event pairs, 54 based on Foata normal form. 64/1514 useless extension candidates. Maximal degree in co-relation 6430. Up to 248 conditions per place. [2022-01-19 13:37:48,573 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 20 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2022-01-19 13:37:48,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 1953 flow [2022-01-19 13:37:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:37:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:37:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-01-19 13:37:48,575 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2022-01-19 13:37:48,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2022-01-19 13:37:48,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2022-01-19 13:37:48,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:48,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2022-01-19 13:37:48,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have 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:37:48,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have 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:37:48,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have 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:37:48,577 INFO L186 Difference]: Start difference. First operand has 146 places, 193 transitions, 1992 flow. Second operand 5 states and 440 transitions. [2022-01-19 13:37:48,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 1953 flow [2022-01-19 13:37:48,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 193 transitions, 1913 flow, removed 20 selfloop flow, removed 0 redundant places. [2022-01-19 13:37:48,620 INFO L242 Difference]: Finished difference. Result has 152 places, 188 transitions, 1870 flow [2022-01-19 13:37:48,620 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1870, PETRI_PLACES=152, PETRI_TRANSITIONS=188} [2022-01-19 13:37:48,621 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 58 predicate places. [2022-01-19 13:37:48,621 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 188 transitions, 1870 flow [2022-01-19 13:37:48,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have 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:37:48,621 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:48,621 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] [2022-01-19 13:37:48,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:37:48,622 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:48,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash 398857980, now seen corresponding path program 1 times [2022-01-19 13:37:48,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:48,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824868590] [2022-01-19 13:37:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:48,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:48,677 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:37:48,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:48,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824868590] [2022-01-19 13:37:48,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824868590] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:48,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:48,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:37:48,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552833677] [2022-01-19 13:37:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:48,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:37:48,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:37:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:37:48,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-01-19 13:37:48,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 188 transitions, 1870 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:37:48,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:48,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-01-19 13:37:48,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:48,940 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,940 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,940 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,940 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,940 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,963 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,964 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,964 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,964 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,964 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,964 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,971 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 36#L70true, Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,972 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-01-19 13:37:48,972 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-01-19 13:37:48,972 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-01-19 13:37:48,972 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-01-19 13:37:48,988 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:48,988 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,988 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,988 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-01-19 13:37:48,988 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,988 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:48,988 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-01-19 13:37:49,034 INFO L129 PetriNetUnfolder]: 909/2760 cut-off events. [2022-01-19 13:37:49,034 INFO L130 PetriNetUnfolder]: For 15791/16029 co-relation queries the response was YES. [2022-01-19 13:37:49,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10247 conditions, 2760 events. 909/2760 cut-off events. For 15791/16029 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24206 event pairs, 180 based on Foata normal form. 45/2608 useless extension candidates. Maximal degree in co-relation 10212. Up to 540 conditions per place. [2022-01-19 13:37:49,068 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 22 selfloop transitions, 5 changer transitions 0/197 dead transitions. [2022-01-19 13:37:49,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 197 transitions, 1954 flow [2022-01-19 13:37:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:37:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:37:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-01-19 13:37:49,069 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.84 [2022-01-19 13:37:49,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2022-01-19 13:37:49,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2022-01-19 13:37:49,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:49,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2022-01-19 13:37:49,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have 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:37:49,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have 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:37:49,071 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have 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:37:49,071 INFO L186 Difference]: Start difference. First operand has 152 places, 188 transitions, 1870 flow. Second operand 5 states and 441 transitions. [2022-01-19 13:37:49,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 197 transitions, 1954 flow [2022-01-19 13:37:49,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 197 transitions, 1950 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:37:49,110 INFO L242 Difference]: Finished difference. Result has 156 places, 190 transitions, 1892 flow [2022-01-19 13:37:49,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1892, PETRI_PLACES=156, PETRI_TRANSITIONS=190} [2022-01-19 13:37:49,111 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 62 predicate places. [2022-01-19 13:37:49,111 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 190 transitions, 1892 flow [2022-01-19 13:37:49,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have 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:37:49,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:49,111 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:37:49,111 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1142839705, now seen corresponding path program 1 times [2022-01-19 13:37:49,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278683045] [2022-01-19 13:37:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:49,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:49,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:49,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278683045] [2022-01-19 13:37:49,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278683045] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:37:49,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504704248] [2022-01-19 13:37:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:49,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:37:49,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:37:49,205 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:37:49,243 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:37:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 13:37:49,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:37:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:49,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:37:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:49,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504704248] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:37:49,698 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:37:49,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-01-19 13:37:49,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497483549] [2022-01-19 13:37:49,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:37:49,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 13:37:49,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 13:37:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:37:49,700 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-01-19 13:37:49,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 190 transitions, 1892 flow. Second operand has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have 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:37:49,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:49,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-01-19 13:37:49,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:50,687 INFO L129 PetriNetUnfolder]: 2420/6000 cut-off events. [2022-01-19 13:37:50,687 INFO L130 PetriNetUnfolder]: For 47366/47443 co-relation queries the response was YES. [2022-01-19 13:37:50,731 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27569 conditions, 6000 events. 2420/6000 cut-off events. For 47366/47443 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 56079 event pairs, 143 based on Foata normal form. 55/6002 useless extension candidates. Maximal degree in co-relation 27532. Up to 887 conditions per place. [2022-01-19 13:37:50,755 INFO L132 encePairwiseOnDemand]: 91/105 looper letters, 145 selfloop transitions, 156 changer transitions 103/488 dead transitions. [2022-01-19 13:37:50,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 488 transitions, 6447 flow [2022-01-19 13:37:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 13:37:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 13:37:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1717 transitions. [2022-01-19 13:37:50,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7786848072562358 [2022-01-19 13:37:50,758 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1717 transitions. [2022-01-19 13:37:50,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1717 transitions. [2022-01-19 13:37:50,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:50,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1717 transitions. [2022-01-19 13:37:50,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 81.76190476190476) internal successors, (1717), 21 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have 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:37:50,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have 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:37:50,764 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have 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:37:50,765 INFO L186 Difference]: Start difference. First operand has 156 places, 190 transitions, 1892 flow. Second operand 21 states and 1717 transitions. [2022-01-19 13:37:50,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 488 transitions, 6447 flow [2022-01-19 13:37:50,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 488 transitions, 6443 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:37:50,856 INFO L242 Difference]: Finished difference. Result has 186 places, 307 transitions, 4032 flow [2022-01-19 13:37:50,856 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4032, PETRI_PLACES=186, PETRI_TRANSITIONS=307} [2022-01-19 13:37:50,857 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 92 predicate places. [2022-01-19 13:37:50,857 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 307 transitions, 4032 flow [2022-01-19 13:37:50,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have 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:37:50,857 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:50,857 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,875 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:37:51,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 13:37:51,072 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1871322637, now seen corresponding path program 1 times [2022-01-19 13:37:51,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:51,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77091998] [2022-01-19 13:37:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:51,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:51,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77091998] [2022-01-19 13:37:51,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77091998] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:37:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121408969] [2022-01-19 13:37:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:51,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:37:51,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:37:51,196 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:37:51,197 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:37:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:51,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 13:37:51,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:37:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:51,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:37:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:51,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121408969] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:37:51,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:37:51,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-01-19 13:37:51,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533008936] [2022-01-19 13:37:51,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:37:51,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 13:37:51,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 13:37:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:37:51,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-01-19 13:37:51,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 307 transitions, 4032 flow. Second operand has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have 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:37:51,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:51,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-01-19 13:37:51,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:53,352 INFO L129 PetriNetUnfolder]: 3706/9300 cut-off events. [2022-01-19 13:37:53,353 INFO L130 PetriNetUnfolder]: For 109592/110028 co-relation queries the response was YES. [2022-01-19 13:37:53,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52354 conditions, 9300 events. 3706/9300 cut-off events. For 109592/110028 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 92377 event pairs, 193 based on Foata normal form. 168/9362 useless extension candidates. Maximal degree in co-relation 52304. Up to 1580 conditions per place. [2022-01-19 13:37:53,438 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 137 selfloop transitions, 181 changer transitions 294/696 dead transitions. [2022-01-19 13:37:53,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 696 transitions, 11218 flow [2022-01-19 13:37:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 13:37:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 13:37:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1722 transitions. [2022-01-19 13:37:53,442 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.780952380952381 [2022-01-19 13:37:53,442 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1722 transitions. [2022-01-19 13:37:53,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1722 transitions. [2022-01-19 13:37:53,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:53,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1722 transitions. [2022-01-19 13:37:53,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.0) internal successors, (1722), 21 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have 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:37:53,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have 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:37:53,448 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have 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:37:53,448 INFO L186 Difference]: Start difference. First operand has 186 places, 307 transitions, 4032 flow. Second operand 21 states and 1722 transitions. [2022-01-19 13:37:53,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 696 transitions, 11218 flow [2022-01-19 13:37:53,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 696 transitions, 10886 flow, removed 125 selfloop flow, removed 5 redundant places. [2022-01-19 13:37:53,812 INFO L242 Difference]: Finished difference. Result has 211 places, 360 transitions, 5277 flow [2022-01-19 13:37:53,813 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3875, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5277, PETRI_PLACES=211, PETRI_TRANSITIONS=360} [2022-01-19 13:37:53,813 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 117 predicate places. [2022-01-19 13:37:53,813 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 360 transitions, 5277 flow [2022-01-19 13:37:53,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have 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:37:53,814 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:53,814 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 13:37:54,014 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,SelfDestructingSolverStorable11 [2022-01-19 13:37:54,015 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1427515022, now seen corresponding path program 2 times [2022-01-19 13:37:54,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474230608] [2022-01-19 13:37:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:54,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:37:54,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:54,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474230608] [2022-01-19 13:37:54,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474230608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:54,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:54,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:37:54,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570074809] [2022-01-19 13:37:54,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:54,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:37:54,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:54,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:37:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:37:54,053 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-01-19 13:37:54,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 360 transitions, 5277 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:37:54,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:54,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-01-19 13:37:54,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:54,542 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][94], [Black: 252#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1347#true, Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 773#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 140#true, Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 785#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 767#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 769#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 248#true, Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 25#L110-4true, Black: 1334#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1322#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1332#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 1330#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1320#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1328#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1316#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), Black: 175#true, Black: 1318#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), 111#true, Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), 807#(<= 0 ~pos~0), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), 7#L46true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 258#true, Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:54,542 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 13:37:54,542 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-01-19 13:37:54,542 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-01-19 13:37:54,542 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-01-19 13:37:54,981 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][246], [Black: 252#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1115#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, Black: 773#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 785#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 767#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 570#(not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)), 248#true, Black: 769#(and (= ~pos~0 0) (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, Black: 1334#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1322#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 1332#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 807#(<= 0 ~pos~0), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 1330#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1320#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1328#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 175#true, Black: 1316#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 2 ~pos~0)), 111#true, Black: 1318#(and (not (<= (mod thread2Thread1of1ForFork2_~lv_assert~1 256) 0)) (<= 0 ~pos~0)), Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 44#L54true, Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 1349#(= (+ ~d1~0 (* (- 256) (div ~d1~0 256))) 0), 49#L78true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 5#L111-4true, Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-01-19 13:37:54,982 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 13:37:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:37:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 13:37:54,982 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 13:37:55,078 INFO L129 PetriNetUnfolder]: 2008/6736 cut-off events. [2022-01-19 13:37:55,078 INFO L130 PetriNetUnfolder]: For 84386/85861 co-relation queries the response was YES. [2022-01-19 13:37:55,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37088 conditions, 6736 events. 2008/6736 cut-off events. For 84386/85861 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 72930 event pairs, 285 based on Foata normal form. 572/7130 useless extension candidates. Maximal degree in co-relation 37028. Up to 850 conditions per place. [2022-01-19 13:37:55,157 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 48 selfloop transitions, 5 changer transitions 5/346 dead transitions. [2022-01-19 13:37:55,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 346 transitions, 4999 flow [2022-01-19 13:37:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:37:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:37:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2022-01-19 13:37:55,158 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2022-01-19 13:37:55,158 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2022-01-19 13:37:55,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2022-01-19 13:37:55,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:55,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2022-01-19 13:37:55,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:37:55,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:37:55,160 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:37:55,160 INFO L186 Difference]: Start difference. First operand has 211 places, 360 transitions, 5277 flow. Second operand 4 states and 379 transitions. [2022-01-19 13:37:55,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 346 transitions, 4999 flow [2022-01-19 13:37:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 346 transitions, 4792 flow, removed 38 selfloop flow, removed 11 redundant places. [2022-01-19 13:37:55,499 INFO L242 Difference]: Finished difference. Result has 204 places, 329 transitions, 4554 flow [2022-01-19 13:37:55,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4554, PETRI_PLACES=204, PETRI_TRANSITIONS=329} [2022-01-19 13:37:55,500 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 110 predicate places. [2022-01-19 13:37:55,500 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 329 transitions, 4554 flow [2022-01-19 13:37:55,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have 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:37:55,500 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:55,501 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:37:55,501 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1468701142, now seen corresponding path program 2 times [2022-01-19 13:37:55,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:55,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132124413] [2022-01-19 13:37:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:55,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:37:55,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:55,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132124413] [2022-01-19 13:37:55,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132124413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:37:55,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:37:55,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:37:55,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018797413] [2022-01-19 13:37:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:37:55,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:37:55,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:37:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:37:55,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-01-19 13:37:55,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 329 transitions, 4554 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have 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:37:55,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:55,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-01-19 13:37:55,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:56,628 INFO L129 PetriNetUnfolder]: 2341/7077 cut-off events. [2022-01-19 13:37:56,628 INFO L130 PetriNetUnfolder]: For 84681/85595 co-relation queries the response was YES. [2022-01-19 13:37:56,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40175 conditions, 7077 events. 2341/7077 cut-off events. For 84681/85595 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 71343 event pairs, 432 based on Foata normal form. 484/7297 useless extension candidates. Maximal degree in co-relation 40117. Up to 987 conditions per place. [2022-01-19 13:37:56,698 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 5 changer transitions 2/336 dead transitions. [2022-01-19 13:37:56,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 4531 flow [2022-01-19 13:37:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:37:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:37:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2022-01-19 13:37:56,700 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-01-19 13:37:56,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2022-01-19 13:37:56,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2022-01-19 13:37:56,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:56,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2022-01-19 13:37:56,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have 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:37:56,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:37:56,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have 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:37:56,701 INFO L186 Difference]: Start difference. First operand has 204 places, 329 transitions, 4554 flow. Second operand 4 states and 378 transitions. [2022-01-19 13:37:56,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 4531 flow [2022-01-19 13:37:56,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 336 transitions, 4427 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-01-19 13:37:56,926 INFO L242 Difference]: Finished difference. Result has 207 places, 313 transitions, 4140 flow [2022-01-19 13:37:56,926 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4133, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4140, PETRI_PLACES=207, PETRI_TRANSITIONS=313} [2022-01-19 13:37:56,926 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 113 predicate places. [2022-01-19 13:37:56,926 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 313 transitions, 4140 flow [2022-01-19 13:37:56,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have 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:37:56,927 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:37:56,927 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:37:56,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:37:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:37:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash 232289249, now seen corresponding path program 1 times [2022-01-19 13:37:56,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:37:56,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460344107] [2022-01-19 13:37:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:56,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:37:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:57,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:37:57,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460344107] [2022-01-19 13:37:57,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460344107] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:37:57,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263714804] [2022-01-19 13:37:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:37:57,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:37:57,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:37:57,009 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:37:57,010 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:37:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:37:57,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 13:37:57,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:37:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:57,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:37:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:37:57,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263714804] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:37:57,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:37:57,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-01-19 13:37:57,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362681762] [2022-01-19 13:37:57,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:37:57,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:37:57,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:37:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:37:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:37:57,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-01-19 13:37:57,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 313 transitions, 4140 flow. Second operand has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have 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:37:57,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:37:57,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-01-19 13:37:57,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:37:59,604 INFO L129 PetriNetUnfolder]: 4070/10815 cut-off events. [2022-01-19 13:37:59,604 INFO L130 PetriNetUnfolder]: For 145828/146230 co-relation queries the response was YES. [2022-01-19 13:37:59,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66363 conditions, 10815 events. 4070/10815 cut-off events. For 145828/146230 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 111838 event pairs, 182 based on Foata normal form. 287/11042 useless extension candidates. Maximal degree in co-relation 66303. Up to 1607 conditions per place. [2022-01-19 13:37:59,710 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 149 selfloop transitions, 185 changer transitions 253/730 dead transitions. [2022-01-19 13:37:59,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 730 transitions, 11864 flow [2022-01-19 13:37:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 13:37:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 13:37:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2109 transitions. [2022-01-19 13:37:59,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7725274725274726 [2022-01-19 13:37:59,713 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2109 transitions. [2022-01-19 13:37:59,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2109 transitions. [2022-01-19 13:37:59,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:37:59,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2109 transitions. [2022-01-19 13:37:59,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.11538461538461) internal successors, (2109), 26 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have 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:37:59,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have 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:37:59,718 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have 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:37:59,718 INFO L186 Difference]: Start difference. First operand has 207 places, 313 transitions, 4140 flow. Second operand 26 states and 2109 transitions. [2022-01-19 13:37:59,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 730 transitions, 11864 flow [2022-01-19 13:38:00,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 730 transitions, 11822 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-01-19 13:38:00,204 INFO L242 Difference]: Finished difference. Result has 246 places, 399 transitions, 6013 flow [2022-01-19 13:38:00,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4106, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6013, PETRI_PLACES=246, PETRI_TRANSITIONS=399} [2022-01-19 13:38:00,204 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 152 predicate places. [2022-01-19 13:38:00,204 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 399 transitions, 6013 flow [2022-01-19 13:38:00,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have 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:38:00,205 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:38:00,205 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,220 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:38:00,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:38:00,411 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:38:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:38:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1866638169, now seen corresponding path program 2 times [2022-01-19 13:38:00,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:38:00,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960225633] [2022-01-19 13:38:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:38:00,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:38:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:38:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:00,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:38:00,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960225633] [2022-01-19 13:38:00,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960225633] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:38:00,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433638406] [2022-01-19 13:38:00,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:38:00,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:38:00,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:38:00,499 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:38:00,500 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:38:00,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:38:00,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:38:00,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 13:38:00,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:38:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:00,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:38:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:00,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433638406] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:38:00,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:38:00,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-01-19 13:38:00,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445388579] [2022-01-19 13:38:00,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:38:00,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:38:00,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:38:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:38:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:38:00,923 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-01-19 13:38:00,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 399 transitions, 6013 flow. Second operand has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:38:00,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:38:00,924 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-01-19 13:38:00,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:38:04,297 INFO L129 PetriNetUnfolder]: 6420/14656 cut-off events. [2022-01-19 13:38:04,298 INFO L130 PetriNetUnfolder]: For 298211/298231 co-relation queries the response was YES. [2022-01-19 13:38:04,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109942 conditions, 14656 events. 6420/14656 cut-off events. For 298211/298231 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 151559 event pairs, 224 based on Foata normal form. 85/14706 useless extension candidates. Maximal degree in co-relation 109867. Up to 2640 conditions per place. [2022-01-19 13:38:04,476 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 403 selfloop transitions, 258 changer transitions 295/1024 dead transitions. [2022-01-19 13:38:04,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1024 transitions, 19581 flow [2022-01-19 13:38:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 13:38:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 13:38:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3008 transitions. [2022-01-19 13:38:04,480 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7538847117794486 [2022-01-19 13:38:04,480 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3008 transitions. [2022-01-19 13:38:04,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3008 transitions. [2022-01-19 13:38:04,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:38:04,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3008 transitions. [2022-01-19 13:38:04,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 79.15789473684211) internal successors, (3008), 38 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have 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:38:04,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have 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:38:04,488 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have 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:38:04,488 INFO L186 Difference]: Start difference. First operand has 246 places, 399 transitions, 6013 flow. Second operand 38 states and 3008 transitions. [2022-01-19 13:38:04,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1024 transitions, 19581 flow [2022-01-19 13:38:05,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1024 transitions, 18340 flow, removed 602 selfloop flow, removed 10 redundant places. [2022-01-19 13:38:05,947 INFO L242 Difference]: Finished difference. Result has 294 places, 514 transitions, 8231 flow [2022-01-19 13:38:05,948 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=5626, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8231, PETRI_PLACES=294, PETRI_TRANSITIONS=514} [2022-01-19 13:38:05,948 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 200 predicate places. [2022-01-19 13:38:05,948 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 514 transitions, 8231 flow [2022-01-19 13:38:05,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:38:05,949 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:38:05,949 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 13:38:06,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 13:38:06,159 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:38:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:38:06,160 INFO L85 PathProgramCache]: Analyzing trace with hash 5327971, now seen corresponding path program 3 times [2022-01-19 13:38:06,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:38:06,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125126966] [2022-01-19 13:38:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:38:06,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:38:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:38:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:06,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:38:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125126966] [2022-01-19 13:38:06,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125126966] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:38:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485142543] [2022-01-19 13:38:06,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 13:38:06,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:38:06,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:38:06,245 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:38:06,246 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:38:06,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-19 13:38:06,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:38:06,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 13:38:06,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:38:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:06,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:38:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:38:06,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485142543] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:38:06,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:38:06,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-01-19 13:38:06,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816307825] [2022-01-19 13:38:06,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:38:06,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 13:38:06,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:38:06,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 13:38:06,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-01-19 13:38:06,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2022-01-19 13:38:06,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 514 transitions, 8231 flow. Second operand has 16 states, 16 states have (on average 76.125) internal successors, (1218), 16 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have 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:38:06,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:38:06,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2022-01-19 13:38:06,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:38:10,249 INFO L129 PetriNetUnfolder]: 6581/14492 cut-off events. [2022-01-19 13:38:10,250 INFO L130 PetriNetUnfolder]: For 328923/328937 co-relation queries the response was YES. [2022-01-19 13:38:10,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110266 conditions, 14492 events. 6581/14492 cut-off events. For 328923/328937 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 148980 event pairs, 215 based on Foata normal form. 44/14507 useless extension candidates. Maximal degree in co-relation 110166. Up to 2849 conditions per place. [2022-01-19 13:38:10,547 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 0 selfloop transitions, 0 changer transitions 1002/1002 dead transitions. [2022-01-19 13:38:10,547 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1002 transitions, 20163 flow [2022-01-19 13:38:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-19 13:38:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-01-19 13:38:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3031 transitions. [2022-01-19 13:38:10,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7401709401709402 [2022-01-19 13:38:10,550 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3031 transitions. [2022-01-19 13:38:10,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3031 transitions. [2022-01-19 13:38:10,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:38:10,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3031 transitions. [2022-01-19 13:38:10,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 77.71794871794872) internal successors, (3031), 39 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have 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:38:10,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 105.0) internal successors, (4200), 40 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have 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:38:10,558 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 105.0) internal successors, (4200), 40 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have 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:38:10,558 INFO L186 Difference]: Start difference. First operand has 294 places, 514 transitions, 8231 flow. Second operand 39 states and 3031 transitions. [2022-01-19 13:38:10,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1002 transitions, 20163 flow [2022-01-19 13:38:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1002 transitions, 17817 flow, removed 490 selfloop flow, removed 36 redundant places. [2022-01-19 13:38:12,590 INFO L242 Difference]: Finished difference. Result has 261 places, 0 transitions, 0 flow [2022-01-19 13:38:12,591 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=7103, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=0, PETRI_PLACES=261, PETRI_TRANSITIONS=0} [2022-01-19 13:38:12,591 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 167 predicate places. [2022-01-19 13:38:12,591 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 0 transitions, 0 flow [2022-01-19 13:38:12,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 76.125) internal successors, (1218), 16 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have 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:38:12,593 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 13:38:12,593 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 13:38:12,593 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 13:38:12,593 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 13:38:12,615 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:38:12,811 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,SelfDestructingSolverStorable16 [2022-01-19 13:38:12,814 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1] [2022-01-19 13:38:12,816 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 13:38:12,816 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 13:38:12,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 01:38:12 BasicIcfg [2022-01-19 13:38:12,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 13:38:12,818 INFO L158 Benchmark]: Toolchain (without parser) took 27699.04ms. Allocated memory was 367.0MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 313.8MB in the beginning and 4.4GB in the end (delta: -4.1GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2022-01-19 13:38:12,818 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 367.0MB. Free memory is still 330.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 13:38:12,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.18ms. Allocated memory is still 367.0MB. Free memory was 313.6MB in the beginning and 339.1MB in the end (delta: -25.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. [2022-01-19 13:38:12,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.96ms. Allocated memory is still 367.0MB. Free memory was 339.1MB in the beginning and 337.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 13:38:12,818 INFO L158 Benchmark]: Boogie Preprocessor took 14.54ms. Allocated memory is still 367.0MB. Free memory was 337.0MB in the beginning and 336.0MB in the end (delta: 995.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 13:38:12,819 INFO L158 Benchmark]: RCFGBuilder took 290.39ms. Allocated memory is still 367.0MB. Free memory was 336.0MB in the beginning and 320.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 13:38:12,819 INFO L158 Benchmark]: TraceAbstraction took 27185.40ms. Allocated memory was 367.0MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 320.2MB in the beginning and 4.4GB in the end (delta: -4.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2022-01-19 13:38:12,820 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 367.0MB. Free memory is still 330.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 179.18ms. Allocated memory is still 367.0MB. Free memory was 313.6MB in the beginning and 339.1MB in the end (delta: -25.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 25.96ms. Allocated memory is still 367.0MB. Free memory was 339.1MB in the beginning and 337.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 14.54ms. Allocated memory is still 367.0MB. Free memory was 337.0MB in the beginning and 336.0MB in the end (delta: 995.8kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 290.39ms. Allocated memory is still 367.0MB. Free memory was 336.0MB in the beginning and 320.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 27185.40ms. Allocated memory was 367.0MB in the beginning and 7.1GB in the end (delta: 6.7GB). Free memory was 320.2MB in the beginning and 4.4GB in the end (delta: -4.0GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.1s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1330 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 232 mSDtfsCounter, 3188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1126 GetRequests, 894 SyntacticMatches, 5 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8231occurred in iteration=16, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 5859 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 99/181 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-19 13:38:12,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...