/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:27:53,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:27:53,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:27:53,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:27:53,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:27:53,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:27:53,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:27:53,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:27:53,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:27:53,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:27:53,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:27:53,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:27:53,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:27:53,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:27:53,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:27:53,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:27:53,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:27:53,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:27:53,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:27:53,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:27:53,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:27:53,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:27:53,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:27:53,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:27:53,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:27:53,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:27:53,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:27:53,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:27:53,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:27:53,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:27:53,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:27:53,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:27:53,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:27:53,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:27:53,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:27:53,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:27:53,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:27:53,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:27:53,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:27:53,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:27:53,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:27:53,608 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-RepeatedSemanticLbe.epf [2022-12-13 01:27:53,631 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:27:53,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:27:53,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:27:53,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:27:53,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:27:53,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:27:53,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:27:53,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:27:53,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:27:53,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:27:53,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:27:53,635 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-12-13 01:27:53,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:27:53,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:27:53,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:27:53,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:27:53,902 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:27:53,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-12-13 01:27:54,825 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:27:54,974 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:27:54,975 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-12-13 01:27:54,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e75fc52/e0ee74e0cfff43f9abb992b6bd2adbb3/FLAG0a511e6c8 [2022-12-13 01:27:54,990 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05e75fc52/e0ee74e0cfff43f9abb992b6bd2adbb3 [2022-12-13 01:27:54,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:27:54,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:27:54,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:27:54,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:27:54,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:27:54,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:54" (1/1) ... [2022-12-13 01:27:54,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0f5a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:54, skipping insertion in model container [2022-12-13 01:27:54,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:54" (1/1) ... [2022-12-13 01:27:55,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:27:55,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:27:55,128 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2954,2967] [2022-12-13 01:27:55,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:27:55,147 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:27:55,166 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2954,2967] [2022-12-13 01:27:55,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:27:55,178 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:27:55,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55 WrapperNode [2022-12-13 01:27:55,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:27:55,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:27:55,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:27:55,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:27:55,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,221 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 202 [2022-12-13 01:27:55,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:27:55,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:27:55,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:27:55,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:27:55,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,251 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:27:55,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:27:55,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:27:55,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:27:55,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (1/1) ... [2022-12-13 01:27:55,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:27:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:27:55,288 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-12-13 01:27:55,294 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-12-13 01:27:55,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:27:55,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:27:55,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:27:55,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:27:55,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:27:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:27:55,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:27:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:27:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:27:55,320 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:27:55,433 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:27:55,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:27:55,729 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:27:55,736 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:27:55,736 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:27:55,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:55 BoogieIcfgContainer [2022-12-13 01:27:55,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:27:55,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:27:55,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:27:55,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:27:55,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:27:54" (1/3) ... [2022-12-13 01:27:55,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4cee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:55, skipping insertion in model container [2022-12-13 01:27:55,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:55" (2/3) ... [2022-12-13 01:27:55,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4cee29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:55, skipping insertion in model container [2022-12-13 01:27:55,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:55" (3/3) ... [2022-12-13 01:27:55,752 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2022-12-13 01:27:55,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:27:55,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:27:55,777 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:27:55,875 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:27:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 240 transitions, 504 flow [2022-12-13 01:27:56,014 INFO L130 PetriNetUnfolder]: 13/237 cut-off events. [2022-12-13 01:27:56,014 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:27:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 237 events. 13/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 335 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 01:27:56,022 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 240 transitions, 504 flow [2022-12-13 01:27:56,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 227 transitions, 472 flow [2022-12-13 01:27:56,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:27:56,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 227 transitions, 472 flow [2022-12-13 01:27:56,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 227 transitions, 472 flow [2022-12-13 01:27:56,122 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-12-13 01:27:56,122 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:27:56,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 227 events. 13/227 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 334 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 01:27:56,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 227 transitions, 472 flow [2022-12-13 01:27:56,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 16638 [2022-12-13 01:28:02,967 INFO L241 LiptonReduction]: Total number of compositions: 211 [2022-12-13 01:28:02,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:28:02,981 INFO L357 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=REPEATED_LIPTON_PN, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14b128f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:28:02,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:28:02,987 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 01:28:02,987 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:28:02,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:28:02,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:28:02,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:28:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:28:02,991 INFO L85 PathProgramCache]: Analyzing trace with hash 865913725, now seen corresponding path program 1 times [2022-12-13 01:28:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:28:03,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853177347] [2022-12-13 01:28:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:28:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:28:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:28:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:28:03,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:28:03,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853177347] [2022-12-13 01:28:03,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853177347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:28:03,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:28:03,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:28:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858436969] [2022-12-13 01:28:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:28:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:28:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:28:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:28:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:28:03,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:28:03,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:03,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:28:03,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:28:03,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:28:03,965 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 01:28:03,965 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 01:28:03,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-13 01:28:03,966 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 01:28:03,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 01:28:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:28:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:28:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 01:28:03,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 01:28:03,975 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-13 01:28:03,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 01:28:03,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:28:03,978 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-13 01:28:03,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-13 01:28:03,982 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-13 01:28:03,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:28:03,982 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-13 01:28:03,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:28:03,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:28:03,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-13 01:28:03,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-13 01:28:03,989 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-13 01:28:03,989 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:28:03,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-13 01:28:03,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-13 01:28:03,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 01:28:04,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [943] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_109| |v_thread3Thread1of1ForFork1_plus_~b#1_107|))) (and (= |v_thread3Thread1of1ForFork1_~s2~2#1_27| |v_thread3Thread1of1ForFork1_plus_#res#1_77|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_77|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|) (= |v_thread3Thread1of1ForFork1_#res#1.base_19| 0) (<= 0 (+ |v_thread3Thread1of1ForFork1_~s2~2#1_27| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| v_~seq_1_start_7~0_61) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_107| 0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|) (<= |v_thread3Thread1of1ForFork1_~s1~2#1_27| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_49| |v_thread3Thread1of1ForFork1_plus_~b#1_107|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_49| v_~seq_2_start_8~0_57) (= |v_thread3Thread1of1ForFork1_~s1~2#1_27| (+ v_~seq_2_start_2~0_55 v_~seq_1_start_1~0_51)) (= v_~result_11~0_36 (ite (< v_~score_6~0_47 v_~score_0~0_61) (- 1) (ite (< v_~score_0~0_61 v_~score_6~0_47) 1 (ite (< |v_thread3Thread1of1ForFork1_~s1~2#1_27| |v_thread3Thread1of1ForFork1_~s2~2#1_27|) (- 1) (ite (< |v_thread3Thread1of1ForFork1_~s2~2#1_27| |v_thread3Thread1of1ForFork1_~s1~2#1_27|) 1 0))))) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| |v_thread3Thread1of1ForFork1_plus_~a#1_109|) (= |v_thread3Thread1of1ForFork1_#res#1.offset_19| 0) (<= |v_thread3Thread1of1ForFork1_~s2~2#1_27| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~s1~2#1_27| 2147483648)))) InVars {~score_0~0=v_~score_0~0_61, ~seq_2_start_2~0=v_~seq_2_start_2~0_55, ~seq_1_start_1~0=v_~seq_1_start_1~0_51, ~seq_1_start_7~0=v_~seq_1_start_7~0_61, ~seq_2_start_8~0=v_~seq_2_start_8~0_57, ~score_6~0=v_~score_6~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_99|, ~seq_2_start_2~0=v_~seq_2_start_2~0_55, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_77|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_135|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_39|, thread3Thread1of1ForFork1_#t~ret6#1=|v_thread3Thread1of1ForFork1_#t~ret6#1_35|, thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_109|, ~score_0~0=v_~score_0~0_61, thread3Thread1of1ForFork1_~s1~2#1=|v_thread3Thread1of1ForFork1_~s1~2#1_27|, ~seq_1_start_1~0=v_~seq_1_start_1~0_51, thread3Thread1of1ForFork1_~s2~2#1=|v_thread3Thread1of1ForFork1_~s2~2#1_27|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_49|, ~seq_1_start_7~0=v_~seq_1_start_7~0_61, ~seq_2_start_8~0=v_~seq_2_start_8~0_57, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_19|, ~score_6~0=v_~score_6~0_47, thread3Thread1of1ForFork1_#t~ret5#1=|v_thread3Thread1of1ForFork1_#t~ret5#1_35|, ~result_11~0=v_~result_11~0_36, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_107|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret6#1, thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~s1~2#1, thread3Thread1of1ForFork1_~s2~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~ret5#1, ~result_11~0, thread3Thread1of1ForFork1_plus_~b#1] and [940] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_101| |v_thread1Thread1of1ForFork2_plus_~b#1_103|)) (.cse1 (+ v_~seq_2_start_2~0_53 v_~seq_1_start_1~0_49))) (and (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_59|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_17| 0) (= |v_thread1Thread1of1ForFork2_~s2~0#1_21| |v_thread1Thread1of1ForFork2_plus_#res#1_59|) (= (ite (< v_~score_3~0_51 v_~score_0~0_59) (- 1) (ite (< v_~score_0~0_59 v_~score_3~0_51) 1 (ite (< |v_thread1Thread1of1ForFork2_~s1~0#1_35| |v_thread1Thread1of1ForFork2_~s2~0#1_21|) (- 1) (ite (< |v_thread1Thread1of1ForFork2_~s2~0#1_21| |v_thread1Thread1of1ForFork2_~s1~0#1_35|) 1 0)))) v_~result_9~0_34) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#res#1_59| 2147483648)) (<= 0 (+ v_~seq_2_start_2~0_53 v_~seq_1_start_1~0_49 2147483648)) (= |v_thread1Thread1of1ForFork2_#res#1.base_17| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_45| |v_thread1Thread1of1ForFork2_plus_~b#1_103|) (= |v_thread1Thread1of1ForFork2_~s1~0#1_35| .cse1) (= v_~seq_2_start_5~0_43 |v_thread1Thread1of1ForFork2_plus_#in~b#1_45|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_101| |v_thread1Thread1of1ForFork2_plus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_103| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_41| v_~seq_1_start_4~0_49) (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#res#1_59| 2147483647))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_49, ~score_0~0=v_~score_0~0_59, ~seq_2_start_2~0=v_~seq_2_start_2~0_53, ~seq_1_start_1~0=v_~seq_1_start_1~0_49, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, ~score_3~0=v_~score_3~0_51} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_45|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, ~seq_2_start_2~0=v_~seq_2_start_2~0_53, thread1Thread1of1ForFork2_~s2~0#1=|v_thread1Thread1of1ForFork2_~s2~0#1_21|, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, ~result_9~0=v_~result_9~0_34, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_103|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_41|, thread1Thread1of1ForFork2_~s1~0#1=|v_thread1Thread1of1ForFork2_~s1~0#1_35|, ~seq_1_start_4~0=v_~seq_1_start_4~0_49, ~score_0~0=v_~score_0~0_59, ~seq_1_start_1~0=v_~seq_1_start_1~0_49, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_17|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_101|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_17|, ~score_3~0=v_~score_3~0_51, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_59|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_~s2~0#1, ~result_9~0, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~s1~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] [2022-12-13 01:28:04,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:28:04,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 605 [2022-12-13 01:28:04,587 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-13 01:28:04,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:04,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:28:04,588 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:28:04,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:28:04,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:28:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:28:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 927589825, now seen corresponding path program 2 times [2022-12-13 01:28:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:28:04,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352747324] [2022-12-13 01:28:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:28:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:28:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:28:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:28:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:28:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352747324] [2022-12-13 01:28:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352747324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:28:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:28:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:28:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380772366] [2022-12-13 01:28:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:28:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:28:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:28:04,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:28:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:28:04,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 01:28:04,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:04,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:28:04,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 01:28:04,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:28:05,073 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-13 01:28:05,073 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 01:28:05,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 434 event pairs, 7 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-13 01:28:05,076 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 11/48 dead transitions. [2022-12-13 01:28:05,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 251 flow [2022-12-13 01:28:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:28:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:28:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 01:28:05,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 01:28:05,078 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 46 transitions. [2022-12-13 01:28:05,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 251 flow [2022-12-13 01:28:05,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 247 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:28:05,080 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 103 flow [2022-12-13 01:28:05,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-13 01:28:05,081 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2022-12-13 01:28:05,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:28:05,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 103 flow [2022-12-13 01:28:05,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:28:05,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:28:05,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 103 flow [2022-12-13 01:28:05,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 103 flow [2022-12-13 01:28:05,088 INFO L130 PetriNetUnfolder]: 1/39 cut-off events. [2022-12-13 01:28:05,088 INFO L131 PetriNetUnfolder]: For 29/32 co-relation queries the response was YES. [2022-12-13 01:28:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 39 events. 1/39 cut-off events. For 29/32 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2022-12-13 01:28:05,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 103 flow [2022-12-13 01:28:05,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:28:05,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_101| |v_thread1Thread1of1ForFork2_plus_~b#1_103|)) (.cse1 (+ v_~seq_2_start_2~0_53 v_~seq_1_start_1~0_49))) (and (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_59|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_17| 0) (= |v_thread1Thread1of1ForFork2_~s2~0#1_21| |v_thread1Thread1of1ForFork2_plus_#res#1_59|) (= (ite (< v_~score_3~0_51 v_~score_0~0_59) (- 1) (ite (< v_~score_0~0_59 v_~score_3~0_51) 1 (ite (< |v_thread1Thread1of1ForFork2_~s1~0#1_35| |v_thread1Thread1of1ForFork2_~s2~0#1_21|) (- 1) (ite (< |v_thread1Thread1of1ForFork2_~s2~0#1_21| |v_thread1Thread1of1ForFork2_~s1~0#1_35|) 1 0)))) v_~result_9~0_34) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#res#1_59| 2147483648)) (<= 0 (+ v_~seq_2_start_2~0_53 v_~seq_1_start_1~0_49 2147483648)) (= |v_thread1Thread1of1ForFork2_#res#1.base_17| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_45| |v_thread1Thread1of1ForFork2_plus_~b#1_103|) (= |v_thread1Thread1of1ForFork2_~s1~0#1_35| .cse1) (= v_~seq_2_start_5~0_43 |v_thread1Thread1of1ForFork2_plus_#in~b#1_45|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_101| |v_thread1Thread1of1ForFork2_plus_#in~a#1_41|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_103| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_41| v_~seq_1_start_4~0_49) (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#res#1_59| 2147483647))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_49, ~score_0~0=v_~score_0~0_59, ~seq_2_start_2~0=v_~seq_2_start_2~0_53, ~seq_1_start_1~0=v_~seq_1_start_1~0_49, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, ~score_3~0=v_~score_3~0_51} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_45|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_37|, ~seq_2_start_2~0=v_~seq_2_start_2~0_53, thread1Thread1of1ForFork2_~s2~0#1=|v_thread1Thread1of1ForFork2_~s2~0#1_21|, ~seq_2_start_5~0=v_~seq_2_start_5~0_43, ~result_9~0=v_~result_9~0_34, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_103|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_41|, thread1Thread1of1ForFork2_~s1~0#1=|v_thread1Thread1of1ForFork2_~s1~0#1_35|, ~seq_1_start_4~0=v_~seq_1_start_4~0_49, ~score_0~0=v_~score_0~0_59, ~seq_1_start_1~0=v_~seq_1_start_1~0_49, thread1Thread1of1ForFork2_#t~ret2#1=|v_thread1Thread1of1ForFork2_#t~ret2#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_17|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_101|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_17|, ~score_3~0=v_~score_3~0_51, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_59|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_~s2~0#1, ~result_9~0, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~s1~0#1, thread1Thread1of1ForFork2_#t~ret2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_plus_#res#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1] and [942] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_93| |v_thread2Thread1of1ForFork0_plus_~b#1_93|))) (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_11| 0) (= |v_thread2Thread1of1ForFork0_plus_#res#1_79| |v_thread2Thread1of1ForFork0_~s2~1#1_23|) (<= |v_thread2Thread1of1ForFork0_~s1~1#1_33| 2147483647) (<= |v_thread2Thread1of1ForFork0_~s2~1#1_23| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.base_11| 0) (<= 0 (+ |v_thread2Thread1of1ForFork0_~s2~1#1_23| 2147483648)) (<= 0 (+ |v_thread2Thread1of1ForFork0_~s1~1#1_33| 2147483648)) (= |v_thread2Thread1of1ForFork0_~s1~1#1_33| (+ v_~seq_2_start_5~0_47 v_~seq_1_start_4~0_53)) (= v_~result_10~0_36 (ite (< v_~score_6~0_45 v_~score_3~0_53) (- 1) (ite (< v_~score_3~0_53 v_~score_6~0_45) 1 (ite (< |v_thread2Thread1of1ForFork0_~s1~1#1_33| |v_thread2Thread1of1ForFork0_~s2~1#1_23|) (- 1) (ite (< |v_thread2Thread1of1ForFork0_~s2~1#1_23| |v_thread2Thread1of1ForFork0_~s1~1#1_33|) 1 0))))) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_47| v_~seq_1_start_7~0_59) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_93| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_93| |v_thread2Thread1of1ForFork0_plus_#in~b#1_45|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_79| .cse0) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_45| v_~seq_2_start_8~0_55) (= |v_thread2Thread1of1ForFork0_plus_~a#1_93| |v_thread2Thread1of1ForFork0_plus_#in~a#1_47|))) InVars {~seq_1_start_4~0=v_~seq_1_start_4~0_53, ~seq_1_start_7~0=v_~seq_1_start_7~0_59, ~seq_2_start_8~0=v_~seq_2_start_8~0_55, ~score_6~0=v_~score_6~0_45, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, ~score_3~0=v_~score_3~0_53} OutVars{thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_47|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_11|, thread2Thread1of1ForFork0_~s1~1#1=|v_thread2Thread1of1ForFork0_~s1~1#1_33|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_93|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_89|, ~seq_2_start_5~0=v_~seq_2_start_5~0_47, thread2Thread1of1ForFork0_#t~ret3#1=|v_thread2Thread1of1ForFork0_#t~ret3#1_43|, thread2Thread1of1ForFork0_~s2~1#1=|v_thread2Thread1of1ForFork0_~s2~1#1_23|, thread2Thread1of1ForFork0_#t~ret4#1=|v_thread2Thread1of1ForFork0_#t~ret4#1_33|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_45|, ~seq_1_start_4~0=v_~seq_1_start_4~0_53, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_11|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_79|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_93|, ~seq_1_start_7~0=v_~seq_1_start_7~0_59, ~seq_2_start_8~0=v_~seq_2_start_8~0_55, ~score_6~0=v_~score_6~0_45, ~result_10~0=v_~result_10~0_36, ~score_3~0=v_~score_3~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~s1~1#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~ret3#1, thread2Thread1of1ForFork0_~s2~1#1, thread2Thread1of1ForFork0_#t~ret4#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, ~result_10~0] [2022-12-13 01:28:05,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:28:05,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 546 [2022-12-13 01:28:05,627 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 109 flow [2022-12-13 01:28:05,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:05,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:28:05,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:28:05,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:28:05,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:28:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:28:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash -528445508, now seen corresponding path program 1 times [2022-12-13 01:28:05,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:28:05,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803524397] [2022-12-13 01:28:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:28:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:28:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:28:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:28:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:28:05,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803524397] [2022-12-13 01:28:05,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803524397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:28:05,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:28:05,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:28:05,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611296576] [2022-12-13 01:28:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:28:05,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:28:05,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:28:05,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:28:05,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:28:05,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 01:28:05,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 109 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:05,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:28:05,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 01:28:05,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:28:05,966 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-13 01:28:05,966 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 01:28:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 99 events. 31/99 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 321 event pairs, 11 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 312. Up to 84 conditions per place. [2022-12-13 01:28:05,968 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 20 selfloop transitions, 3 changer transitions 8/31 dead transitions. [2022-12-13 01:28:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 183 flow [2022-12-13 01:28:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:28:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:28:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-13 01:28:05,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 01:28:05,970 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 109 flow. Second operand 4 states and 31 transitions. [2022-12-13 01:28:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 183 flow [2022-12-13 01:28:05,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 174 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:28:05,971 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 79 flow [2022-12-13 01:28:05,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2022-12-13 01:28:05,972 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-13 01:28:05,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:28:05,972 INFO L89 Accepts]: Start accepts. Operand has 36 places, 18 transitions, 79 flow [2022-12-13 01:28:05,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:28:05,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:28:05,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 18 transitions, 79 flow [2022-12-13 01:28:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 79 flow [2022-12-13 01:28:05,978 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 01:28:05,978 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 01:28:05,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 29 events. 0/29 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 01:28:05,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 79 flow [2022-12-13 01:28:05,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 01:28:05,979 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:28:05,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 01:28:05,980 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 79 flow [2022-12-13 01:28:05,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:05,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:28:05,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:28:05,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:28:05,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:28:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:28:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1100496115, now seen corresponding path program 3 times [2022-12-13 01:28:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:28:05,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446503549] [2022-12-13 01:28:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:28:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:28:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:28:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:28:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:28:06,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446503549] [2022-12-13 01:28:06,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446503549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:28:06,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:28:06,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:28:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744000515] [2022-12-13 01:28:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:28:06,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:28:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:28:06,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:28:06,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:28:06,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:28:06,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 79 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:06,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:28:06,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:28:06,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:28:06,430 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-13 01:28:06,430 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-12-13 01:28:06,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 84 events. 28/84 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 232 event pairs, 5 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 144. Up to 37 conditions per place. [2022-12-13 01:28:06,431 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 21 selfloop transitions, 3 changer transitions 13/37 dead transitions. [2022-12-13 01:28:06,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 205 flow [2022-12-13 01:28:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:28:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:28:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-13 01:28:06,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2022-12-13 01:28:06,433 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 79 flow. Second operand 6 states and 37 transitions. [2022-12-13 01:28:06,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 205 flow [2022-12-13 01:28:06,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 190 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 01:28:06,436 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 61 flow [2022-12-13 01:28:06,436 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-13 01:28:06,437 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 01:28:06,437 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:28:06,437 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 61 flow [2022-12-13 01:28:06,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:28:06,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:28:06,438 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 61 flow [2022-12-13 01:28:06,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 61 flow [2022-12-13 01:28:06,441 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 01:28:06,441 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:28:06,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 16 events. 0/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 01:28:06,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 61 flow [2022-12-13 01:28:06,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 01:28:06,442 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:28:06,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 01:28:06,448 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 61 flow [2022-12-13 01:28:06,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:06,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:28:06,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:28:06,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:28:06,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:28:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:28:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash -781738377, now seen corresponding path program 4 times [2022-12-13 01:28:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:28:06,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804059447] [2022-12-13 01:28:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:28:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:28:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:28:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:28:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:28:06,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804059447] [2022-12-13 01:28:06,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804059447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:28:06,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:28:06,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:28:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991356740] [2022-12-13 01:28:06,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:28:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:28:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:28:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:28:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:28:06,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 01:28:06,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 61 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:06,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:28:06,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 01:28:06,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:28:06,876 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-13 01:28:06,876 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 01:28:06,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 37 events. 11/37 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 123. Up to 12 conditions per place. [2022-12-13 01:28:06,877 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-13 01:28:06,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 135 flow [2022-12-13 01:28:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:28:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:28:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-13 01:28:06,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 01:28:06,877 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 61 flow. Second operand 6 states and 27 transitions. [2022-12-13 01:28:06,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 135 flow [2022-12-13 01:28:06,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 01:28:06,878 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-13 01:28:06,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-13 01:28:06,879 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-13 01:28:06,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:28:06,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-13 01:28:06,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:28:06,879 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:28:06,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:28:06,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:28:06,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:28:06,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:28:06,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:28:06,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 01:28:06,880 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:28:06,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:28:06,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:28:06,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:28:06,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 01:28:06,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 01:28:06,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:28:06,882 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 01:28:06,884 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:28:06,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:28:06,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:28:06 BasicIcfg [2022-12-13 01:28:06,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:28:06,886 INFO L158 Benchmark]: Toolchain (without parser) took 11892.68ms. Allocated memory was 179.3MB in the beginning and 294.6MB in the end (delta: 115.3MB). Free memory was 155.0MB in the beginning and 254.2MB in the end (delta: -99.2MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-12-13 01:28:06,886 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:28:06,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.82ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:28:06,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 179.3MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:28:06,887 INFO L158 Benchmark]: Boogie Preprocessor took 32.88ms. Allocated memory is still 179.3MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:28:06,887 INFO L158 Benchmark]: RCFGBuilder took 483.16ms. Allocated memory is still 179.3MB. Free memory was 138.8MB in the beginning and 118.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 01:28:06,887 INFO L158 Benchmark]: TraceAbstraction took 11146.26ms. Allocated memory was 179.3MB in the beginning and 294.6MB in the end (delta: 115.3MB). Free memory was 117.3MB in the beginning and 254.2MB in the end (delta: -136.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:28:06,888 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.10ms. Allocated memory is still 179.3MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.82ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 179.3MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.88ms. Allocated memory is still 179.3MB. Free memory was 140.4MB in the beginning and 138.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 483.16ms. Allocated memory is still 179.3MB. Free memory was 138.8MB in the beginning and 118.3MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11146.26ms. Allocated memory was 179.3MB in the beginning and 294.6MB in the end (delta: 115.3MB). Free memory was 117.3MB in the beginning and 254.2MB in the end (delta: -136.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 224 PlacesBefore, 26 PlacesAfterwards, 227 TransitionsBefore, 16 TransitionsAfterwards, 16638 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 138 ConcurrentYvCompositions, 13 ChoiceCompositions, 211 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 10583, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9084, independent: 9084, independent conditional: 0, independent unconditional: 9084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9084, independent: 9084, independent conditional: 0, independent unconditional: 9084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10583, independent: 1499, independent conditional: 0, independent unconditional: 1499, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9084, unknown conditional: 0, unknown unconditional: 9084] , Statistics on independence cache: Total cache size (in pairs): 19415, Positive cache size: 19415, Positive conditional cache size: 0, Positive unconditional cache size: 19415, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 33 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 88]: 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, 363 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: 11.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 0 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 830 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 01:28:06,905 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...