/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:17:40,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:17:40,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:17:40,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:17:40,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:17:40,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:17:40,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:17:40,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:17:40,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:17:40,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:17:40,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:17:40,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:17:40,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:17:40,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:17:40,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:17:40,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:17:40,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:17:40,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:17:40,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:17:40,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:17:40,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:17:40,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:17:40,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:17:40,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:17:40,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:17:40,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:17:40,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:17:40,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:17:40,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:17:40,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:17:40,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:17:40,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:17:40,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:17:40,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:17:40,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:17:40,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:17:40,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:17:40,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:17:40,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:17:40,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:17:40,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:17:40,823 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:17:40,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:17:40,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:17:40,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:17:40,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:17:40,850 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:17:40,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:17:40,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:17:40,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:17:40,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:17:40,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:17:40,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:17:40,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:17:40,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:17:40,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:17:40,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:17:40,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:17:40,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:17:40,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:17:40,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:17:40,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:17:40,865 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-06 05:17:41,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:17:41,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:17:41,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:17:41,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:17:41,174 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:17:41,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-06 05:17:42,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:17:42,508 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:17:42,510 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-12-06 05:17:42,522 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2128501/6d7c6818dc8d4cc08a28a236e26ba800/FLAG20a9c9b60 [2022-12-06 05:17:42,534 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b2128501/6d7c6818dc8d4cc08a28a236e26ba800 [2022-12-06 05:17:42,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:17:42,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:17:42,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:17:42,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:17:42,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:17:42,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448f76a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42, skipping insertion in model container [2022-12-06 05:17:42,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:17:42,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:17:42,697 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-06 05:17:42,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:17:42,712 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:17:42,736 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/parallel-misc-1.wvr.c[2755,2768] [2022-12-06 05:17:42,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:17:42,754 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:17:42,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42 WrapperNode [2022-12-06 05:17:42,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:17:42,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:17:42,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:17:42,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:17:42,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,800 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-12-06 05:17:42,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:17:42,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:17:42,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:17:42,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:17:42,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,824 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:17:42,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:17:42,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:17:42,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:17:42,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (1/1) ... [2022-12-06 05:17:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:17:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:17:42,870 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-06 05:17:42,874 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-06 05:17:42,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:17:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:17:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:17:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:17:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:17:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:17:42,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:17:42,906 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:17:42,987 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:17:42,988 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:17:43,340 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:17:43,349 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:17:43,349 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:17:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:17:43 BoogieIcfgContainer [2022-12-06 05:17:43,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:17:43,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:17:43,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:17:43,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:17:43,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:17:42" (1/3) ... [2022-12-06 05:17:43,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dddec49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:17:43, skipping insertion in model container [2022-12-06 05:17:43,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:17:42" (2/3) ... [2022-12-06 05:17:43,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dddec49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:17:43, skipping insertion in model container [2022-12-06 05:17:43,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:17:43" (3/3) ... [2022-12-06 05:17:43,357 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-06 05:17:43,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:17:43,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:17:43,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:17:43,487 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:17:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 688 flow [2022-12-06 05:17:43,629 INFO L130 PetriNetUnfolder]: 28/334 cut-off events. [2022-12-06 05:17:43,630 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:17:43,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 334 events. 28/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 760 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-06 05:17:43,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 336 transitions, 688 flow [2022-12-06 05:17:43,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 326 transitions, 664 flow [2022-12-06 05:17:43,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:43,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-06 05:17:43,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 326 transitions, 664 flow [2022-12-06 05:17:43,721 INFO L130 PetriNetUnfolder]: 28/326 cut-off events. [2022-12-06 05:17:43,722 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:17:43,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 28/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 759 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-06 05:17:43,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 326 transitions, 664 flow [2022-12-06 05:17:43,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 25652 [2022-12-06 05:17:53,634 INFO L203 LiptonReduction]: Total number of compositions: 310 [2022-12-06 05:17:53,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:17:53,650 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;@613ce05c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:17:53,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:17:53,653 INFO L130 PetriNetUnfolder]: 3/15 cut-off events. [2022-12-06 05:17:53,653 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:17:53,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:53,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:53,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:17:53,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:53,658 INFO L85 PathProgramCache]: Analyzing trace with hash -156050190, now seen corresponding path program 1 times [2022-12-06 05:17:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806820699] [2022-12-06 05:17:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:54,264 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-06 05:17:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806820699] [2022-12-06 05:17:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806820699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:54,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:17:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393351071] [2022-12-06 05:17:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:54,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:17:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:54,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:17:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:17:54,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:17:54,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:54,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:54,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:17:54,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:54,428 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2022-12-06 05:17:54,428 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 05:17:54,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2022-12-06 05:17:54,430 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2022-12-06 05:17:54,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2022-12-06 05:17:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:17:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:17:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 05:17:54,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 05:17:54,440 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 5 states and 44 transitions. [2022-12-06 05:17:54,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 43 transitions, 199 flow [2022-12-06 05:17:54,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:17:54,444 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2022-12-06 05:17:54,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=25} [2022-12-06 05:17:54,448 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-06 05:17:54,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:54,449 INFO L89 Accepts]: Start accepts. Operand has 23 places, 25 transitions, 99 flow [2022-12-06 05:17:54,452 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:54,452 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:54,452 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 25 transitions, 99 flow [2022-12-06 05:17:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 25 transitions, 99 flow [2022-12-06 05:17:54,461 INFO L130 PetriNetUnfolder]: 23/58 cut-off events. [2022-12-06 05:17:54,461 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-12-06 05:17:54,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 58 events. 23/58 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 152 event pairs, 2 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 94. Up to 21 conditions per place. [2022-12-06 05:17:54,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 25 transitions, 99 flow [2022-12-06 05:17:54,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:17:55,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1410] L63-1-->L63-1: Formula: (let ((.cse3 (select (select |v_#memory_int_In_42| v_~A~0.base_In_27) (+ (* v_~j~0_In_28 4) v_~A~0.offset_In_27))) (.cse9 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|))) (let ((.cse0 (< v_~j~0_In_28 v_~N~0_In_10)) (.cse1 (= v_~j~0_Out_34 (+ v_~j~0_In_28 1))) (.cse2 (= .cse9 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|)) (.cse4 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|)) (.cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44|)) (.cse8 (+ .cse3 v_~bag2~0_In_21)) (.cse6 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72|)) (.cse7 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72| (ite (or (<= |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44| 0) (<= .cse9 2147483647)) 1 0)))) (or (and (= |v_thread2Thread1of1ForFork1_#t~ret13#1_Out_14| |v_thread2Thread1of1ForFork1_#t~ret13#1_In_3|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70| 2147483648)) .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem14#1_In_2| |v_thread2Thread1of1ForFork1_#t~mem14#1_Out_20|) .cse1 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30| v_~bag2~0_In_21) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70| 2147483647) .cse2 (= v_~bag2~0_Out_34 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|) (= .cse3 |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30|) .cse4 .cse5 .cse6 (= v_~sum2~0_In_17 v_~sum2~0_Out_38) .cse7 (< .cse8 v_~cap2~0_In_6)) (and (= |v_thread2Thread1of1ForFork1_#t~ret12#1_Out_14| |v_thread2Thread1of1ForFork1_#t~ret12#1_In_3|) (<= 0 (+ v_~sum2~0_Out_38 2147483648)) (<= .cse8 2147483647) (<= v_~sum2~0_Out_38 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30| v_~bag2~0_In_21) .cse0 .cse1 .cse2 (= v_~sum2~0_In_17 |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30|) (<= 0 (+ .cse3 v_~bag2~0_In_21 2147483648)) .cse4 (= v_~sum2~0_Out_38 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|) (= |v_thread2Thread1of1ForFork1_#t~mem11#1_Out_22| |v_thread2Thread1of1ForFork1_#t~mem11#1_In_3|) .cse5 (<= v_~cap2~0_In_6 .cse8) .cse6 .cse7 (= .cse3 v_~bag2~0_Out_34))))) InVars {~A~0.base=v_~A~0.base_In_27, ~j~0=v_~j~0_In_28, ~bag2~0=v_~bag2~0_In_21, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_In_3|, ~sum2~0=v_~sum2~0_In_17, ~N~0=v_~N~0_In_10, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_In_3|, ~A~0.offset=v_~A~0.offset_In_27, ~cap2~0=v_~cap2~0_In_6, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_In_2|, #memory_int=|v_#memory_int_In_42|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_In_3|} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30|, ~A~0.base=v_~A~0.base_In_27, ~j~0=v_~j~0_Out_34, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_Out_18|, ~bag2~0=v_~bag2~0_Out_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_Out_22|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72|, ~sum2~0=v_~sum2~0_Out_38, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_Out_14|, ~N~0=v_~N~0_In_10, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_88|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_Out_22|, ~A~0.offset=v_~A~0.offset_In_27, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_Out_20|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|, ~cap2~0=v_~cap2~0_In_6, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_44|, thread2Thread1of1ForFork1_#t~ret10#1=|v_thread2Thread1of1ForFork1_#t~ret10#1_Out_24|, #memory_int=|v_#memory_int_In_42|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, ~j~0, thread2Thread1of1ForFork1_#t~post15#1, ~bag2~0, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret13#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#t~ret10#1, thread2Thread1of1ForFork1_#t~ret12#1] and [1411] L121-->L46-1: Formula: (let ((.cse2 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_In_37| |v_thread1Thread1of1ForFork0_plus_~b#1_In_35|)) (.cse11 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_50| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_46|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_50| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|)) (.cse1 (= (ite (or (<= .cse11 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_50| 0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_68|)) (.cse10 (select (select |v_#memory_int_In_44| v_~A~0.base_In_29) (+ (* v_~i~0_In_24 4) v_~A~0.offset_In_29))) (.cse3 (= |v_thread1Thread1of1ForFork0_plus_#res#1_Out_80| .cse11)) (.cse4 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_21| 0))) (.cse5 (<= .cse2 2147483647)) (.cse6 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_In_37| |v_thread1Thread1of1ForFork0_plus_~b#1_In_35| 2147483648))) (.cse7 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_68| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_78|)) (.cse8 (= v_~i~0_Out_38 (+ v_~i~0_In_24 1))) (.cse9 (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_46| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|))) (or (and .cse0 .cse1 (<= v_~cap1~0_In_7 .cse2) .cse3 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_Out_80| 2147483647) (= v_~sum1~0_Out_50 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_80|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_Out_80| 2147483648)) .cse4 (= |v_thread1Thread1of1ForFork0_#t~ret4#1_In_3| |v_thread1Thread1of1ForFork0_#t~ret4#1_Out_16|) .cse5 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| v_~sum1~0_In_17) (= |v_thread1Thread1of1ForFork0_#t~mem3#1_Out_26| |v_thread1Thread1of1ForFork0_#t~mem3#1_In_3|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32| v_~bag1~0_In_22) .cse6 .cse7 .cse8 .cse9 (= .cse10 v_~bag1~0_Out_44)) (and (<= v_~bag1~0_Out_44 2147483647) .cse0 .cse1 (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32| v_~bag1~0_In_22) (= .cse10 |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|) .cse3 (= |v_thread1Thread1of1ForFork0_#t~mem6#1_Out_14| |v_thread1Thread1of1ForFork0_#t~mem6#1_In_3|) (= v_~sum1~0_Out_50 v_~sum1~0_In_17) .cse4 .cse5 (= |v_thread1Thread1of1ForFork0_#t~ret5#1_In_4| |v_thread1Thread1of1ForFork0_#t~ret5#1_Out_18|) (< .cse2 v_~cap1~0_In_7) (<= 0 (+ v_~bag1~0_Out_44 2147483648)) .cse6 .cse7 .cse8 .cse9 (= v_~bag1~0_Out_44 |v_thread1Thread1of1ForFork0_plus_#res#1_Out_80|))))) InVars {~A~0.base=v_~A~0.base_In_29, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_In_37|, ~i~0=v_~i~0_In_24, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_In_3|, ~bag1~0=v_~bag1~0_In_22, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_In_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_In_35|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_21|, ~A~0.offset=v_~A~0.offset_In_29, ~sum1~0=v_~sum1~0_In_17, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_In_4|, ~cap1~0=v_~cap1~0_In_7, #memory_int=|v_#memory_int_In_44|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_In_3|} OutVars{~A~0.base=v_~A~0.base_In_29, thread1Thread1of1ForFork0_#t~post7#1=|v_thread1Thread1of1ForFork0_#t~post7#1_Out_22|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_46|, ~i~0=v_~i~0_Out_38, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_Out_14|, ~bag1~0=v_~bag1~0_Out_44, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_Out_16|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_50|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_32|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_68|, ~A~0.offset=v_~A~0.offset_In_29, ~sum1~0=v_~sum1~0_Out_50, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_Out_18|, ~cap1~0=v_~cap1~0_In_7, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_Out_24|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_78|, #memory_int=|v_#memory_int_In_44|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_Out_26|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_80|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_32|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post7#1, thread1Thread1of1ForFork0_plus_~a#1, ~i~0, thread1Thread1of1ForFork0_#t~mem6#1, ~bag1~0, thread1Thread1of1ForFork0_#t~ret4#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum1~0, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:17:56,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:56,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2404 [2022-12-06 05:17:56,853 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 107 flow [2022-12-06 05:17:56,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:56,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:56,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:56,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:17:56,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:17:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1490817756, now seen corresponding path program 1 times [2022-12-06 05:17:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:56,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022523222] [2022-12-06 05:17:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:57,004 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-06 05:17:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:57,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022523222] [2022-12-06 05:17:57,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022523222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:57,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:17:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570585890] [2022-12-06 05:17:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:57,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:57,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:17:57,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:57,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:57,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:17:57,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:57,118 INFO L130 PetriNetUnfolder]: 158/288 cut-off events. [2022-12-06 05:17:57,118 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-06 05:17:57,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 288 events. 158/288 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1076 event pairs, 71 based on Foata normal form. 18/286 useless extension candidates. Maximal degree in co-relation 415. Up to 119 conditions per place. [2022-12-06 05:17:57,120 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 45 selfloop transitions, 6 changer transitions 1/52 dead transitions. [2022-12-06 05:17:57,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 52 transitions, 310 flow [2022-12-06 05:17:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:17:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:17:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 05:17:57,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2022-12-06 05:17:57,121 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 107 flow. Second operand 5 states and 43 transitions. [2022-12-06 05:17:57,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 52 transitions, 310 flow [2022-12-06 05:17:57,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:17:57,124 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 156 flow [2022-12-06 05:17:57,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2022-12-06 05:17:57,125 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2022-12-06 05:17:57,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:57,125 INFO L89 Accepts]: Start accepts. Operand has 30 places, 28 transitions, 156 flow [2022-12-06 05:17:57,126 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:57,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:57,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 28 transitions, 156 flow [2022-12-06 05:17:57,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 156 flow [2022-12-06 05:17:57,136 INFO L130 PetriNetUnfolder]: 31/93 cut-off events. [2022-12-06 05:17:57,137 INFO L131 PetriNetUnfolder]: For 59/60 co-relation queries the response was YES. [2022-12-06 05:17:57,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 93 events. 31/93 cut-off events. For 59/60 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 337 event pairs, 3 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 141. Up to 34 conditions per place. [2022-12-06 05:17:57,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 156 flow [2022-12-06 05:17:57,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 05:17:59,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:17:59,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2072 [2022-12-06 05:17:59,197 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 158 flow [2022-12-06 05:17:59,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:59,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:59,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:59,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:17:59,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:17:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1284299981, now seen corresponding path program 1 times [2022-12-06 05:17:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:59,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738261544] [2022-12-06 05:17:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:59,369 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-06 05:17:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738261544] [2022-12-06 05:17:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738261544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:59,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:17:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660227311] [2022-12-06 05:17:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:59,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:59,370 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:17:59,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:59,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:59,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:17:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:59,543 INFO L130 PetriNetUnfolder]: 207/366 cut-off events. [2022-12-06 05:17:59,543 INFO L131 PetriNetUnfolder]: For 499/499 co-relation queries the response was YES. [2022-12-06 05:17:59,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 366 events. 207/366 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1393 event pairs, 77 based on Foata normal form. 8/373 useless extension candidates. Maximal degree in co-relation 591. Up to 290 conditions per place. [2022-12-06 05:17:59,545 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 42 selfloop transitions, 12 changer transitions 1/55 dead transitions. [2022-12-06 05:17:59,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 397 flow [2022-12-06 05:17:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:17:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:17:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 05:17:59,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 05:17:59,547 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 158 flow. Second operand 4 states and 46 transitions. [2022-12-06 05:17:59,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 397 flow [2022-12-06 05:17:59,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 55 transitions, 373 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-06 05:17:59,551 INFO L231 Difference]: Finished difference. Result has 34 places, 38 transitions, 278 flow [2022-12-06 05:17:59,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=34, PETRI_TRANSITIONS=38} [2022-12-06 05:17:59,552 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-06 05:17:59,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:59,552 INFO L89 Accepts]: Start accepts. Operand has 34 places, 38 transitions, 278 flow [2022-12-06 05:17:59,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:59,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:59,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 38 transitions, 278 flow [2022-12-06 05:17:59,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 38 transitions, 278 flow [2022-12-06 05:17:59,598 INFO L130 PetriNetUnfolder]: 48/132 cut-off events. [2022-12-06 05:17:59,598 INFO L131 PetriNetUnfolder]: For 154/160 co-relation queries the response was YES. [2022-12-06 05:17:59,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 132 events. 48/132 cut-off events. For 154/160 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 540 event pairs, 4 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 180. Up to 48 conditions per place. [2022-12-06 05:17:59,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 38 transitions, 278 flow [2022-12-06 05:17:59,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 05:17:59,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:17:59,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 05:17:59,600 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 38 transitions, 278 flow [2022-12-06 05:17:59,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:59,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:17:59,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:17:59,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:17:59,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:17:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:17:59,601 INFO L85 PathProgramCache]: Analyzing trace with hash -193934541, now seen corresponding path program 2 times [2022-12-06 05:17:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:17:59,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086853526] [2022-12-06 05:17:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:17:59,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:17:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:17:59,779 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-06 05:17:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:17:59,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086853526] [2022-12-06 05:17:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086853526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:17:59,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:17:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:17:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323170649] [2022-12-06 05:17:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:17:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:17:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:17:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:17:59,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:17:59,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:17:59,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 38 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:17:59,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:17:59,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:17:59,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:17:59,897 INFO L130 PetriNetUnfolder]: 219/389 cut-off events. [2022-12-06 05:17:59,898 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2022-12-06 05:17:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 389 events. 219/389 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1559 event pairs, 73 based on Foata normal form. 8/397 useless extension candidates. Maximal degree in co-relation 672. Up to 243 conditions per place. [2022-12-06 05:17:59,899 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 46 selfloop transitions, 14 changer transitions 0/60 dead transitions. [2022-12-06 05:17:59,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 535 flow [2022-12-06 05:17:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:17:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:17:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 05:17:59,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41 [2022-12-06 05:17:59,900 INFO L175 Difference]: Start difference. First operand has 33 places, 38 transitions, 278 flow. Second operand 5 states and 41 transitions. [2022-12-06 05:17:59,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 535 flow [2022-12-06 05:17:59,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 523 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 05:17:59,903 INFO L231 Difference]: Finished difference. Result has 38 places, 41 transitions, 332 flow [2022-12-06 05:17:59,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=38, PETRI_TRANSITIONS=41} [2022-12-06 05:17:59,903 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 18 predicate places. [2022-12-06 05:17:59,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:17:59,904 INFO L89 Accepts]: Start accepts. Operand has 38 places, 41 transitions, 332 flow [2022-12-06 05:17:59,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:17:59,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:17:59,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 41 transitions, 332 flow [2022-12-06 05:17:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 41 transitions, 332 flow [2022-12-06 05:17:59,918 INFO L130 PetriNetUnfolder]: 49/136 cut-off events. [2022-12-06 05:17:59,919 INFO L131 PetriNetUnfolder]: For 253/261 co-relation queries the response was YES. [2022-12-06 05:17:59,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 136 events. 49/136 cut-off events. For 253/261 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 565 event pairs, 5 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 251. Up to 48 conditions per place. [2022-12-06 05:17:59,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 41 transitions, 332 flow [2022-12-06 05:17:59,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 05:18:02,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:02,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2210 [2022-12-06 05:18:02,114 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 41 transitions, 334 flow [2022-12-06 05:18:02,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-06 05:18:02,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:02,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:02,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:18:02,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1120100628, now seen corresponding path program 1 times [2022-12-06 05:18:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:02,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739361900] [2022-12-06 05:18:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739361900] [2022-12-06 05:18:02,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739361900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:02,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:02,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:02,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142471794] [2022-12-06 05:18:02,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:02,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:18:02,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:02,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:18:02,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:18:02,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:18:02,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 41 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-06 05:18:02,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:02,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:18:02,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:02,394 INFO L130 PetriNetUnfolder]: 169/297 cut-off events. [2022-12-06 05:18:02,395 INFO L131 PetriNetUnfolder]: For 808/808 co-relation queries the response was YES. [2022-12-06 05:18:02,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 297 events. 169/297 cut-off events. For 808/808 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1037 event pairs, 86 based on Foata normal form. 6/302 useless extension candidates. Maximal degree in co-relation 860. Up to 271 conditions per place. [2022-12-06 05:18:02,397 INFO L137 encePairwiseOnDemand]: 20/22 looper letters, 37 selfloop transitions, 0 changer transitions 11/48 dead transitions. [2022-12-06 05:18:02,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 449 flow [2022-12-06 05:18:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:18:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:18:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:18:02,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2022-12-06 05:18:02,399 INFO L175 Difference]: Start difference. First operand has 38 places, 41 transitions, 334 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:18:02,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 449 flow [2022-12-06 05:18:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 433 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 05:18:02,403 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 289 flow [2022-12-06 05:18:02,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 05:18:02,404 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-06 05:18:02,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:02,404 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 289 flow [2022-12-06 05:18:02,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:02,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:02,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 289 flow [2022-12-06 05:18:02,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 289 flow [2022-12-06 05:18:02,418 INFO L130 PetriNetUnfolder]: 41/98 cut-off events. [2022-12-06 05:18:02,418 INFO L131 PetriNetUnfolder]: For 201/213 co-relation queries the response was YES. [2022-12-06 05:18:02,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 98 events. 41/98 cut-off events. For 201/213 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 336 event pairs, 3 based on Foata normal form. 4/99 useless extension candidates. Maximal degree in co-relation 295. Up to 39 conditions per place. [2022-12-06 05:18:02,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 37 transitions, 289 flow [2022-12-06 05:18:02,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 05:18:02,420 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:02,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:18:02,423 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 289 flow [2022-12-06 05:18:02,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-06 05:18:02,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:02,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:02,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:18:02,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1021648044, now seen corresponding path program 1 times [2022-12-06 05:18:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327468063] [2022-12-06 05:18:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:02,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:02,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327468063] [2022-12-06 05:18:02,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327468063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:02,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:02,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658568061] [2022-12-06 05:18:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:18:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:18:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:18:02,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:18:02,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-06 05:18:02,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:02,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:18:02,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:02,656 INFO L130 PetriNetUnfolder]: 188/319 cut-off events. [2022-12-06 05:18:02,656 INFO L131 PetriNetUnfolder]: For 903/903 co-relation queries the response was YES. [2022-12-06 05:18:02,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 319 events. 188/319 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1115 event pairs, 67 based on Foata normal form. 16/335 useless extension candidates. Maximal degree in co-relation 1243. Up to 258 conditions per place. [2022-12-06 05:18:02,658 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 45 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-12-06 05:18:02,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 476 flow [2022-12-06 05:18:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:18:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:18:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:18:02,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 05:18:02,660 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 289 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:18:02,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 476 flow [2022-12-06 05:18:02,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 460 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:02,664 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2022-12-06 05:18:02,666 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2022-12-06 05:18:02,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:02,666 INFO L89 Accepts]: Start accepts. Operand has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,667 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:02,667 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:02,667 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,679 INFO L130 PetriNetUnfolder]: 39/103 cut-off events. [2022-12-06 05:18:02,680 INFO L131 PetriNetUnfolder]: For 191/201 co-relation queries the response was YES. [2022-12-06 05:18:02,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 103 events. 39/103 cut-off events. For 191/201 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 377 event pairs, 3 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 200. Up to 40 conditions per place. [2022-12-06 05:18:02,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:18:02,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:02,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 05:18:02,682 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 329 flow [2022-12-06 05:18:02,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-06 05:18:02,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:02,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:02,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:18:02,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1550461251, now seen corresponding path program 1 times [2022-12-06 05:18:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:02,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089437825] [2022-12-06 05:18:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:04,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089437825] [2022-12-06 05:18:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089437825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766790655] [2022-12-06 05:18:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:04,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:18:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:18:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:04,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 05:18:04,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:04,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 05:18:04,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:18:04,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:18:04,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 289 [2022-12-06 05:18:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:04,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:05,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766790655] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:05,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:05,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-06 05:18:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554802177] [2022-12-06 05:18:05,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:05,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:18:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:05,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:18:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=191, Unknown=3, NotChecked=0, Total=272 [2022-12-06 05:18:05,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:18:05,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 329 flow. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-06 05:18:05,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:05,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:18:05,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:15,848 WARN L233 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 103 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:18:17,160 INFO L130 PetriNetUnfolder]: 177/323 cut-off events. [2022-12-06 05:18:17,160 INFO L131 PetriNetUnfolder]: For 670/670 co-relation queries the response was YES. [2022-12-06 05:18:17,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 323 events. 177/323 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1247 event pairs, 6 based on Foata normal form. 8/321 useless extension candidates. Maximal degree in co-relation 881. Up to 129 conditions per place. [2022-12-06 05:18:17,162 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 55 selfloop transitions, 46 changer transitions 10/111 dead transitions. [2022-12-06 05:18:17,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 111 transitions, 886 flow [2022-12-06 05:18:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:18:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:18:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-12-06 05:18:17,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2022-12-06 05:18:17,165 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 329 flow. Second operand 15 states and 109 transitions. [2022-12-06 05:18:17,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 111 transitions, 886 flow [2022-12-06 05:18:17,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 111 transitions, 877 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:17,169 INFO L231 Difference]: Finished difference. Result has 57 places, 66 transitions, 663 flow [2022-12-06 05:18:17,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=663, PETRI_PLACES=57, PETRI_TRANSITIONS=66} [2022-12-06 05:18:17,170 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 37 predicate places. [2022-12-06 05:18:17,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:17,170 INFO L89 Accepts]: Start accepts. Operand has 57 places, 66 transitions, 663 flow [2022-12-06 05:18:17,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:17,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:17,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 66 transitions, 663 flow [2022-12-06 05:18:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 66 transitions, 663 flow [2022-12-06 05:18:17,191 INFO L130 PetriNetUnfolder]: 55/133 cut-off events. [2022-12-06 05:18:17,191 INFO L131 PetriNetUnfolder]: For 479/485 co-relation queries the response was YES. [2022-12-06 05:18:17,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 133 events. 55/133 cut-off events. For 479/485 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 515 event pairs, 2 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 551. Up to 51 conditions per place. [2022-12-06 05:18:17,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 66 transitions, 663 flow [2022-12-06 05:18:17,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:18:17,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1378] L46-1-->L121: Formula: (and (= (select (select |v_#memory_int_In_25| v_~A~0.base_In_13) (+ v_~A~0.offset_In_13 (* v_~i~0_In_10 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14| v_~bag1~0_In_12) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|) 2147483647)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| 0)) (< v_~i~0_In_10 v_~N~0_In_2)) InVars {~A~0.base=v_~A~0.base_In_13, ~A~0.offset=v_~A~0.offset_In_13, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, #memory_int=|v_#memory_int_In_25|, ~N~0=v_~N~0_In_2} OutVars{~A~0.base=v_~A~0.base_In_13, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|, ~N~0=v_~N~0_In_2, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44|, ~A~0.offset=v_~A~0.offset_In_13, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42|, #memory_int=|v_#memory_int_In_25|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1415] L63-1-->thread2EXIT: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_217| |v_thread2Thread1of1ForFork1_plus_~a#1_217|))) (and (<= |v_thread2Thread1of1ForFork1_plus_#res#1_171| 2147483647) (= |v_thread2Thread1of1ForFork1_plus_~b#1_217| |v_thread2Thread1of1ForFork1_plus_#in~b#1_107|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_109| |v_thread2Thread1of1ForFork1_plus_~a#1_217|) (= (ite (or (<= |v_thread2Thread1of1ForFork1_plus_~b#1_217| 0) (<= .cse0 2147483647)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_209|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_171| 2147483648)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_15|) (= v_~bag2~0_156 |v_thread2Thread1of1ForFork1_plus_#in~b#1_107|) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_171|) (= v_~sum2~0_143 |v_thread2Thread1of1ForFork1_plus_#res#1_171|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_209| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|) (let ((.cse3 (select (select |v_#memory_int_233| v_~A~0.base_161) (+ (* v_~j~0_164 4) v_~A~0.offset_161))) (.cse10 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_218| |v_thread2Thread1of1ForFork1_plus_~a#1_218|))) (let ((.cse1 (= |v_thread2Thread1of1ForFork1_plus_#res#1_172| .cse10)) (.cse2 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_110| |v_thread2Thread1of1ForFork1_plus_~a#1_218|)) (.cse9 (+ v_~bag2~0_157 .cse3)) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|)) (.cse5 (= v_~j~0_163 (+ v_~j~0_164 1))) (.cse6 (< v_~j~0_164 v_~N~0_94)) (.cse7 (= |v_thread2Thread1of1ForFork1_plus_~b#1_218| |v_thread2Thread1of1ForFork1_plus_#in~b#1_108|)) (.cse8 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210| (ite (or (<= |v_thread2Thread1of1ForFork1_plus_~b#1_218| 0) (<= .cse10 2147483647)) 1 0)))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem14#1_49| |v_thread2Thread1of1ForFork1_#t~mem14#1_50|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_172| 2147483647) .cse1 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_172| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_110| v_~bag2~0_157) .cse2 (= |v_thread2Thread1of1ForFork1_#t~ret13#1_54| |v_thread2Thread1of1ForFork1_#t~ret13#1_53|) (= v_~bag2~0_156 |v_thread2Thread1of1ForFork1_plus_#res#1_172|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_108| .cse3) .cse4 .cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_109| v_~sum2~0_145) .cse6 .cse7 .cse8 (< .cse9 v_~cap2~0_71)) (and (= |v_thread2Thread1of1ForFork1_#t~ret12#1_48| |v_thread2Thread1of1ForFork1_#t~ret12#1_47|) .cse1 .cse2 (<= .cse9 2147483647) (<= v_~cap2~0_71 .cse9) .cse4 .cse5 (= v_~bag2~0_156 .cse3) (= v_~bag2~0_157 |v_thread2Thread1of1ForFork1_plus_#in~b#1_108|) (<= 0 (+ v_~bag2~0_157 .cse3 2147483648)) .cse6 (<= |v_thread2Thread1of1ForFork1_plus_#in~a#1_109| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#in~a#1_109| 2147483648)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_110| v_~sum2~0_145) .cse7 .cse8 (= |v_thread2Thread1of1ForFork1_#t~mem11#1_52| |v_thread2Thread1of1ForFork1_#t~mem11#1_51|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_109| |v_thread2Thread1of1ForFork1_plus_#res#1_172|))))) (not (< v_~j~0_163 v_~N~0_94)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_15| 0))) InVars {~A~0.base=v_~A~0.base_161, ~j~0=v_~j~0_164, ~A~0.offset=v_~A~0.offset_161, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_50|, ~cap2~0=v_~cap2~0_71, ~bag2~0=v_~bag2~0_157, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_52|, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_48|, ~sum2~0=v_~sum2~0_145, ~N~0=v_~N~0_94, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_54|} OutVars{~A~0.base=v_~A~0.base_161, ~j~0=v_~j~0_163, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_15|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_217|, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_209|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_67|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_171|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_49|, ~cap2~0=v_~cap2~0_71, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_217|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_47|, thread2Thread1of1ForFork1_#t~ret16#1=|v_thread2Thread1of1ForFork1_#t~ret16#1_35|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_109|, ~bag2~0=v_~bag2~0_156, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_51|, ~sum2~0=v_~sum2~0_143, ~N~0=v_~N~0_94, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_53|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_107|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_279|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_15|, ~A~0.offset=v_~A~0.offset_161, thread2Thread1of1ForFork1_#t~ret10#1=|v_thread2Thread1of1ForFork1_#t~ret10#1_87|, #memory_int=|v_#memory_int_233|} AuxVars[|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_210|, |v_thread2Thread1of1ForFork1_plus_~b#1_218|, |v_thread2Thread1of1ForFork1_plus_#in~a#1_110|, |v_thread2Thread1of1ForFork1_plus_#in~b#1_108|, |v_thread2Thread1of1ForFork1_plus_#res#1_172|, |v_thread2Thread1of1ForFork1_plus_~a#1_218|, |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_280|] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, ~j~0, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_#t~post15#1, ~bag2~0, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret13#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#t~ret10#1, thread2Thread1of1ForFork1_#t~ret12#1, thread2Thread1of1ForFork1_#t~ret16#1] [2022-12-06 05:18:18,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1378] L46-1-->L121: Formula: (and (= (select (select |v_#memory_int_In_25| v_~A~0.base_In_13) (+ v_~A~0.offset_In_13 (* v_~i~0_In_10 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14| v_~bag1~0_In_12) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|) 2147483647)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| 0)) (< v_~i~0_In_10 v_~N~0_In_2)) InVars {~A~0.base=v_~A~0.base_In_13, ~A~0.offset=v_~A~0.offset_In_13, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, #memory_int=|v_#memory_int_In_25|, ~N~0=v_~N~0_In_2} OutVars{~A~0.base=v_~A~0.base_In_13, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|, ~N~0=v_~N~0_In_2, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44|, ~A~0.offset=v_~A~0.offset_In_13, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42|, #memory_int=|v_#memory_int_In_25|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1414] L63-1-->L46-1: Formula: (let ((.cse10 (select |v_#memory_int_231| v_~A~0.base_159))) (and (let ((.cse9 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_215| |v_thread2Thread1of1ForFork1_plus_~a#1_215|)) (.cse1 (select .cse10 (+ (* v_~j~0_160 4) v_~A~0.offset_159)))) (let ((.cse3 (+ v_~bag2~0_153 .cse1)) (.cse0 (= |v_thread2Thread1of1ForFork1_plus_~b#1_215| |v_thread2Thread1of1ForFork1_plus_#in~b#1_105|)) (.cse2 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|)) (.cse4 (= |v_thread2Thread1of1ForFork1_plus_#res#1_169| .cse9)) (.cse5 (= v_~j~0_159 (+ v_~j~0_160 1))) (.cse6 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207| (ite (or (<= .cse9 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_215| 0)) 1 0))) (.cse7 (< v_~j~0_160 v_~N~0_92)) (.cse8 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_107| |v_thread2Thread1of1ForFork1_plus_~a#1_215|))) (or (and (= |v_thread2Thread1of1ForFork1_#t~mem11#1_48| |v_thread2Thread1of1ForFork1_#t~mem11#1_47|) .cse0 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_107| v_~sum2~0_140) (= v_~bag2~0_152 .cse1) .cse2 (<= .cse3 2147483647) (<= 0 (+ v_~sum2~0_139 2147483648)) (= v_~bag2~0_153 |v_thread2Thread1of1ForFork1_plus_#in~b#1_105|) .cse4 (= v_~sum2~0_139 |v_thread2Thread1of1ForFork1_plus_#res#1_169|) .cse5 (= |v_thread2Thread1of1ForFork1_#t~ret12#1_44| |v_thread2Thread1of1ForFork1_#t~ret12#1_43|) .cse6 (<= 0 (+ v_~bag2~0_153 .cse1 2147483648)) .cse7 .cse8 (<= v_~cap2~0_69 .cse3) (<= v_~sum2~0_139 2147483647)) (and (< .cse3 v_~cap2~0_69) (= |v_thread2Thread1of1ForFork1_#t~ret13#1_50| |v_thread2Thread1of1ForFork1_#t~ret13#1_49|) (= v_~sum2~0_139 v_~sum2~0_140) .cse0 .cse2 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_107| v_~bag2~0_153) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_169| 2147483648)) (= v_~bag2~0_152 |v_thread2Thread1of1ForFork1_plus_#res#1_169|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_169| 2147483647) .cse4 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_105| .cse1) (= |v_thread2Thread1of1ForFork1_#t~mem14#1_46| |v_thread2Thread1of1ForFork1_#t~mem14#1_45|) .cse5 .cse6 .cse7 .cse8)))) (let ((.cse18 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_242| |v_thread1Thread1of1ForFork0_plus_~b#1_242|)) (.cse22 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_241| |v_thread1Thread1of1ForFork0_plus_~b#1_241|))) (let ((.cse13 (select .cse10 (+ v_~A~0.offset_159 (* v_~i~0_164 4)))) (.cse11 (= |v_thread1Thread1of1ForFork0_plus_~a#1_241| |v_thread1Thread1of1ForFork0_plus_#in~a#1_115|)) (.cse12 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_243| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|)) (.cse14 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_243| (ite (or (<= .cse22 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_241| 0)) 1 0))) (.cse15 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_115| |v_thread1Thread1of1ForFork0_plus_~b#1_241|)) (.cse16 (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244| 0))) (.cse17 (<= .cse18 2147483647)) (.cse19 (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_242| |v_thread1Thread1of1ForFork0_plus_~b#1_242| 2147483648))) (.cse20 (= |v_thread1Thread1of1ForFork0_plus_#res#1_187| .cse22)) (.cse21 (= (+ v_~i~0_164 1) v_~i~0_163))) (or (and .cse11 .cse12 (= v_~bag1~0_180 .cse13) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_187| 2147483648)) (= v_~sum1~0_146 |v_thread1Thread1of1ForFork0_plus_#in~a#1_115|) .cse14 (= |v_thread1Thread1of1ForFork0_plus_#res#1_187| v_~sum1~0_145) .cse15 .cse16 .cse17 (= v_~bag1~0_181 |v_thread1Thread1of1ForFork0_plus_#in~b#1_115|) (<= v_~cap1~0_77 .cse18) .cse19 .cse20 (= |v_thread1Thread1of1ForFork0_#t~ret4#1_48| |v_thread1Thread1of1ForFork0_#t~ret4#1_47|) .cse21 (<= |v_thread1Thread1of1ForFork0_plus_#res#1_187| 2147483647) (= |v_thread1Thread1of1ForFork0_#t~mem3#1_64| |v_thread1Thread1of1ForFork0_#t~mem3#1_63|)) (and (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_115| .cse13) .cse11 .cse12 (< .cse18 v_~cap1~0_77) .cse14 .cse15 .cse16 .cse17 (= |v_thread1Thread1of1ForFork0_#t~mem6#1_44| |v_thread1Thread1of1ForFork0_#t~mem6#1_43|) (<= v_~bag1~0_180 2147483647) (= v_~sum1~0_146 v_~sum1~0_145) (= v_~bag1~0_181 |v_thread1Thread1of1ForFork0_plus_#in~a#1_115|) .cse19 (= v_~bag1~0_180 |v_thread1Thread1of1ForFork0_plus_#res#1_187|) .cse20 .cse21 (<= 0 (+ v_~bag1~0_180 2147483648)) (= |v_thread1Thread1of1ForFork0_#t~ret5#1_48| |v_thread1Thread1of1ForFork0_#t~ret5#1_47|))))))) InVars {~A~0.base=v_~A~0.base_159, ~j~0=v_~j~0_160, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_242|, ~i~0=v_~i~0_164, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_44|, ~bag2~0=v_~bag2~0_153, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_48|, ~bag1~0=v_~bag1~0_181, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_48|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_242|, ~sum2~0=v_~sum2~0_140, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_50|, ~N~0=v_~N~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_244|, ~A~0.offset=v_~A~0.offset_159, ~sum1~0=v_~sum1~0_146, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_46|, ~cap2~0=v_~cap2~0_69, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_48|, ~cap1~0=v_~cap1~0_77, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_44|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_64|} OutVars{~A~0.base=v_~A~0.base_159, thread1Thread1of1ForFork0_#t~post7#1=|v_thread1Thread1of1ForFork0_#t~post7#1_51|, ~j~0=v_~j~0_159, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_43|, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_43|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_215|, ~bag1~0=v_~bag1~0_180, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_47|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_207|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_65|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_45|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_169|, ~cap2~0=v_~cap2~0_69, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_215|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_95|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_43|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_63|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_107|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_241|, ~i~0=v_~i~0_163, ~bag2~0=v_~bag2~0_152, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_47|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_241|, ~sum2~0=v_~sum2~0_139, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_49|, ~N~0=v_~N~0_92, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_105|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_277|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_243|, ~A~0.offset=v_~A~0.offset_159, ~sum1~0=v_~sum1~0_145, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_47|, thread2Thread1of1ForFork1_#t~ret10#1=|v_thread2Thread1of1ForFork1_#t~ret10#1_85|, ~cap1~0=v_~cap1~0_77, #memory_int=|v_#memory_int_231|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_187|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_115|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_71|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post7#1, ~j~0, thread1Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork1_#t~post15#1, thread2Thread1of1ForFork1_plus_~a#1, ~bag1~0, thread1Thread1of1ForFork0_#t~ret4#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~ret12#1, thread1Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_plus_~a#1, ~i~0, ~bag2~0, thread2Thread1of1ForFork1_#t~mem11#1, thread1Thread1of1ForFork0_plus_~b#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret13#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum1~0, thread1Thread1of1ForFork0_#t~ret5#1, thread2Thread1of1ForFork1_#t~ret10#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:18:20,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1407] L63-1-->thread2EXIT: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_209| |v_thread2Thread1of1ForFork1_plus_~a#1_209|))) (and (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_101| |v_thread2Thread1of1ForFork1_plus_~a#1_209|) (= v_~sum2~0_129 |v_thread2Thread1of1ForFork1_plus_#res#1_161|) (= |v_thread2Thread1of1ForFork1_plus_~b#1_209| |v_thread2Thread1of1ForFork1_plus_#in~b#1_99|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_101| v_~sum2~0_130) (= |v_thread2Thread1of1ForFork1_#res#1.offset_13| 0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_13|) (= v_~bag2~0_144 |v_thread2Thread1of1ForFork1_plus_#in~b#1_99|) (not (< v_~j~0_151 v_~N~0_86)) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_161| 2147483647) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_161|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_161| 2147483648)) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_209| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201|))) InVars {~j~0=v_~j~0_151, ~bag2~0=v_~bag2~0_144, ~sum2~0=v_~sum2~0_130, ~N~0=v_~N~0_86} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_101|, ~j~0=v_~j~0_151, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_13|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_209|, ~bag2~0=v_~bag2~0_144, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201|, ~sum2~0=v_~sum2~0_129, ~N~0=v_~N~0_86, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_271|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_13|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_161|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_209|, thread2Thread1of1ForFork1_#t~ret16#1=|v_thread2Thread1of1ForFork1_#t~ret16#1_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret16#1, thread2Thread1of1ForFork1_plus_#in~b#1] and [1378] L46-1-->L121: Formula: (and (= (select (select |v_#memory_int_In_25| v_~A~0.base_In_13) (+ v_~A~0.offset_In_13 (* v_~i~0_In_10 4))) |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14| v_~bag1~0_In_12) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14| |v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| 0) (<= (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|) 2147483647)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32| |v_thread1Thread1of1ForFork0_plus_~a#1_Out_28| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42| 0)) (< v_~i~0_In_10 v_~N~0_In_2)) InVars {~A~0.base=v_~A~0.base_In_13, ~A~0.offset=v_~A~0.offset_In_13, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, #memory_int=|v_#memory_int_In_25|, ~N~0=v_~N~0_In_2} OutVars{~A~0.base=v_~A~0.base_In_13, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_Out_28|, ~i~0=v_~i~0_In_10, ~bag1~0=v_~bag1~0_In_12, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_Out_32|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_Out_14|, ~N~0=v_~N~0_In_2, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_44|, ~A~0.offset=v_~A~0.offset_In_13, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_42|, #memory_int=|v_#memory_int_In_25|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_Out_14|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_Out_38|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:18:21,391 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:18:21,392 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4222 [2022-12-06 05:18:21,392 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 662 flow [2022-12-06 05:18:21,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 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-06 05:18:21,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:21,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:21,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:18:21,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:21,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:21,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 807541314, now seen corresponding path program 1 times [2022-12-06 05:18:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:21,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582953652] [2022-12-06 05:18:21,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:22,458 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-06 05:18:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582953652] [2022-12-06 05:18:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582953652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:22,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264132872] [2022-12-06 05:18:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:22,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:18:22,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:18:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:18:22,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:18:22,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 662 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-06 05:18:22,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:22,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:18:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:22,684 INFO L130 PetriNetUnfolder]: 188/324 cut-off events. [2022-12-06 05:18:22,684 INFO L131 PetriNetUnfolder]: For 1386/1386 co-relation queries the response was YES. [2022-12-06 05:18:22,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 324 events. 188/324 cut-off events. For 1386/1386 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1206 event pairs, 11 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1537. Up to 253 conditions per place. [2022-12-06 05:18:22,687 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 59 selfloop transitions, 27 changer transitions 6/92 dead transitions. [2022-12-06 05:18:22,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 1035 flow [2022-12-06 05:18:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:18:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:18:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-06 05:18:22,689 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2022-12-06 05:18:22,689 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 662 flow. Second operand 6 states and 55 transitions. [2022-12-06 05:18:22,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 1035 flow [2022-12-06 05:18:22,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 900 flow, removed 41 selfloop flow, removed 7 redundant places. [2022-12-06 05:18:22,695 INFO L231 Difference]: Finished difference. Result has 54 places, 72 transitions, 734 flow [2022-12-06 05:18:22,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=734, PETRI_PLACES=54, PETRI_TRANSITIONS=72} [2022-12-06 05:18:22,697 INFO L294 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2022-12-06 05:18:22,697 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:22,697 INFO L89 Accepts]: Start accepts. Operand has 54 places, 72 transitions, 734 flow [2022-12-06 05:18:22,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:22,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:22,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 72 transitions, 734 flow [2022-12-06 05:18:22,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 72 transitions, 734 flow [2022-12-06 05:18:22,715 INFO L130 PetriNetUnfolder]: 59/133 cut-off events. [2022-12-06 05:18:22,715 INFO L131 PetriNetUnfolder]: For 394/405 co-relation queries the response was YES. [2022-12-06 05:18:22,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 133 events. 59/133 cut-off events. For 394/405 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 499 event pairs, 2 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 534. Up to 41 conditions per place. [2022-12-06 05:18:22,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 72 transitions, 734 flow [2022-12-06 05:18:22,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 05:18:22,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1424] L46-1-->thread1EXIT: Formula: (let ((.cse10 (select |v_#memory_int_288| v_~A~0.base_195)) (.cse11 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_279| |v_thread1Thread1of1ForFork0_plus_~b#1_279|))) (and (<= |v_thread1Thread1of1ForFork0_plus_#res#1_216| 2147483647) (= |v_thread1Thread1of1ForFork0_#res#1.base_17| 0) (= |v_thread1Thread1of1ForFork0_plus_~a#1_279| |v_thread1Thread1of1ForFork0_plus_#in~a#1_144|) (let ((.cse1 (select .cse10 (+ (* v_~i~0_210 4) v_~A~0.offset_195)))) (let ((.cse5 (+ v_~bag1~0_226 .cse1)) (.cse9 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_280| |v_thread1Thread1of1ForFork0_plus_~b#1_280|))) (let ((.cse0 (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_311|)) (.cse2 (= |v_thread1Thread1of1ForFork0_plus_#res#1_217| .cse9)) (.cse3 (= (+ v_~i~0_210 1) v_~i~0_209)) (.cse4 (= (ite (or (<= .cse9 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_280| 0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282|)) (.cse6 (= |v_thread1Thread1of1ForFork0_plus_~a#1_280| |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|)) (.cse7 (<= .cse5 2147483647)) (.cse8 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| |v_thread1Thread1of1ForFork0_plus_~b#1_280|))) (or (and .cse0 (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_145| .cse1) .cse2 (= |v_thread1Thread1of1ForFork0_#t~ret5#1_75| |v_thread1Thread1of1ForFork0_#t~ret5#1_74|) (= |v_thread1Thread1of1ForFork0_#t~mem6#1_71| |v_thread1Thread1of1ForFork0_#t~mem6#1_70|) .cse3 .cse4 (= v_~bag1~0_225 |v_thread1Thread1of1ForFork0_plus_#res#1_217|) (<= 0 (+ v_~bag1~0_225 2147483648)) (= v_~bag1~0_226 |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|) (< .cse5 v_~cap1~0_97) (= v_~sum1~0_186 |v_thread1Thread1of1ForFork0_plus_#in~a#1_144|) .cse6 .cse7 .cse8) (and .cse0 (= v_~bag1~0_225 .cse1) (= |v_thread1Thread1of1ForFork0_#t~ret4#1_75| |v_thread1Thread1of1ForFork0_#t~ret4#1_74|) .cse2 .cse3 (<= v_~cap1~0_97 .cse5) .cse4 (= v_~sum1~0_186 |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|) (<= |v_thread1Thread1of1ForFork0_plus_#res#1_217| 2147483647) (<= 0 (+ v_~bag1~0_226 .cse1 2147483648)) (= v_~bag1~0_226 |v_thread1Thread1of1ForFork0_plus_#in~b#1_145|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_217| 2147483648)) .cse6 (= |v_thread1Thread1of1ForFork0_#t~mem3#1_91| |v_thread1Thread1of1ForFork0_#t~mem3#1_90|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_217| |v_thread1Thread1of1ForFork0_plus_#in~a#1_144|) .cse7 .cse8))))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281| (ite (or (<= |v_thread1Thread1of1ForFork0_plus_~b#1_279| 0) (<= .cse11 2147483647)) 1 0)) (< v_~i~0_210 v_~N~0_122) (= v_~bag1~0_225 |v_thread1Thread1of1ForFork0_plus_#in~b#1_144|) (= |v_thread1Thread1of1ForFork0_#res#1.offset_17| 0) (not (< v_~i~0_209 v_~N~0_122)) (let ((.cse13 (select .cse10 (+ v_~A~0.offset_195 (* v_~j~0_192 4)))) (.cse21 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_236| |v_thread2Thread1of1ForFork1_plus_~a#1_236|))) (let ((.cse12 (= v_~j~0_191 (+ v_~j~0_192 1))) (.cse14 (= (ite (or (<= .cse21 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_236| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|)) (.cse16 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_298|)) (.cse17 (< v_~j~0_192 v_~N~0_122)) (.cse18 (= .cse21 |v_thread2Thread1of1ForFork1_plus_#res#1_190|)) (.cse19 (= |v_thread2Thread1of1ForFork1_plus_~b#1_236| |v_thread2Thread1of1ForFork1_plus_#in~b#1_126|)) (.cse15 (+ .cse13 v_~bag2~0_185)) (.cse20 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_128| |v_thread2Thread1of1ForFork1_plus_~a#1_236|))) (or (and .cse12 (= .cse13 |v_thread2Thread1of1ForFork1_plus_#in~b#1_126|) .cse14 (< .cse15 v_~cap2~0_85) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_128| v_~bag2~0_185) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_190| 2147483647) .cse16 (= v_~bag2~0_184 |v_thread2Thread1of1ForFork1_plus_#res#1_190|) .cse17 .cse18 .cse19 (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_190| 2147483648)) (= |v_thread2Thread1of1ForFork1_#t~ret13#1_69| |v_thread2Thread1of1ForFork1_#t~ret13#1_68|) .cse20 (= |v_thread2Thread1of1ForFork1_#t~mem14#1_65| |v_thread2Thread1of1ForFork1_#t~mem14#1_64|) (= v_~sum2~0_178 v_~sum2~0_177)) (and .cse12 .cse14 (= |v_thread2Thread1of1ForFork1_#t~ret12#1_63| |v_thread2Thread1of1ForFork1_#t~ret12#1_62|) (= .cse13 v_~bag2~0_184) (<= 0 (+ v_~sum2~0_177 2147483648)) .cse16 (= v_~sum2~0_177 |v_thread2Thread1of1ForFork1_plus_#res#1_190|) .cse17 (<= .cse15 2147483647) (<= v_~sum2~0_177 2147483647) .cse18 (<= 0 (+ .cse13 v_~bag2~0_185 2147483648)) .cse19 (= |v_thread2Thread1of1ForFork1_#t~mem11#1_67| |v_thread2Thread1of1ForFork1_#t~mem11#1_66|) (<= v_~cap2~0_85 .cse15) .cse20 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_128| v_~sum2~0_178) (= v_~bag2~0_185 |v_thread2Thread1of1ForFork1_plus_#in~b#1_126|))))) (= |v_thread1Thread1of1ForFork0_plus_#res#1_216| .cse11) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_#res#1_216| 2147483648)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_310|) (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_144| |v_thread1Thread1of1ForFork0_plus_~b#1_279|) (= |v_thread1Thread1of1ForFork0_plus_#res#1_216| v_~sum1~0_184))) InVars {~A~0.base=v_~A~0.base_195, ~j~0=v_~j~0_192, ~i~0=v_~i~0_210, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_71|, ~bag2~0=v_~bag2~0_185, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_67|, ~bag1~0=v_~bag1~0_226, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_75|, ~sum2~0=v_~sum2~0_178, ~N~0=v_~N~0_122, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_69|, ~A~0.offset=v_~A~0.offset_195, ~sum1~0=v_~sum1~0_186, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_65|, ~cap2~0=v_~cap2~0_85, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_75|, ~cap1~0=v_~cap1~0_97, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_63|, #memory_int=|v_#memory_int_288|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_91|} OutVars{~A~0.base=v_~A~0.base_195, thread1Thread1of1ForFork0_#t~post7#1=|v_thread1Thread1of1ForFork0_#t~post7#1_65|, ~j~0=v_~j~0_191, thread1Thread1of1ForFork0_#t~mem6#1=|v_thread1Thread1of1ForFork0_#t~mem6#1_70|, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_53|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_236|, ~bag1~0=v_~bag1~0_225, thread1Thread1of1ForFork0_#t~ret4#1=|v_thread1Thread1of1ForFork0_#t~ret4#1_74|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_144|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_228|, thread1Thread1of1ForFork0_#t~ret8#1=|v_thread1Thread1of1ForFork0_#t~ret8#1_35|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_75|, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_64|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_190|, ~cap2~0=v_~cap2~0_85, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_236|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_109|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_310|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_62|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_90|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_17|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_128|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_17|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_279|, ~i~0=v_~i~0_209, ~bag2~0=v_~bag2~0_184, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_66|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_279|, ~sum2~0=v_~sum2~0_177, ~N~0=v_~N~0_122, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_68|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_126|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_298|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_281|, ~A~0.offset=v_~A~0.offset_195, ~sum1~0=v_~sum1~0_184, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_74|, thread2Thread1of1ForFork1_#t~ret10#1=|v_thread2Thread1of1ForFork1_#t~ret10#1_95|, ~cap1~0=v_~cap1~0_97, #memory_int=|v_#memory_int_288|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_216|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_144|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_99|} AuxVars[|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_311|, |v_thread1Thread1of1ForFork0_plus_#in~b#1_145|, |v_thread1Thread1of1ForFork0_plus_#in~a#1_145|, |v_thread1Thread1of1ForFork0_plus_~b#1_280|, |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_282|, |v_thread1Thread1of1ForFork0_plus_~a#1_280|, |v_thread1Thread1of1ForFork0_plus_#res#1_217|] AssignedVars[thread1Thread1of1ForFork0_#t~post7#1, ~j~0, thread1Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork1_#t~post15#1, thread2Thread1of1ForFork1_plus_~a#1, ~bag1~0, thread1Thread1of1ForFork0_#t~ret4#1, thread1Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret8#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~ret12#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, ~i~0, ~bag2~0, thread2Thread1of1ForFork1_#t~mem11#1, thread1Thread1of1ForFork0_plus_~b#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret13#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~sum1~0, thread1Thread1of1ForFork0_#t~ret5#1, thread2Thread1of1ForFork1_#t~ret10#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_#t~mem1#1] and [1410] L63-1-->L63-1: Formula: (let ((.cse3 (select (select |v_#memory_int_In_42| v_~A~0.base_In_27) (+ (* v_~j~0_In_28 4) v_~A~0.offset_In_27))) (.cse9 (+ |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|))) (let ((.cse0 (< v_~j~0_In_28 v_~N~0_In_10)) (.cse1 (= v_~j~0_Out_34 (+ v_~j~0_In_28 1))) (.cse2 (= .cse9 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|)) (.cse4 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30| |v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|)) (.cse5 (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30| |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44|)) (.cse8 (+ .cse3 v_~bag2~0_In_21)) (.cse6 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_88| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72|)) (.cse7 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72| (ite (or (<= |v_thread2Thread1of1ForFork1_plus_~b#1_Out_44| 0) (<= .cse9 2147483647)) 1 0)))) (or (and (= |v_thread2Thread1of1ForFork1_#t~ret13#1_Out_14| |v_thread2Thread1of1ForFork1_#t~ret13#1_In_3|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70| 2147483648)) .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem14#1_In_2| |v_thread2Thread1of1ForFork1_#t~mem14#1_Out_20|) .cse1 (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30| v_~bag2~0_In_21) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70| 2147483647) .cse2 (= v_~bag2~0_Out_34 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|) (= .cse3 |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30|) .cse4 .cse5 .cse6 (= v_~sum2~0_In_17 v_~sum2~0_Out_38) .cse7 (< .cse8 v_~cap2~0_In_6)) (and (= |v_thread2Thread1of1ForFork1_#t~ret12#1_Out_14| |v_thread2Thread1of1ForFork1_#t~ret12#1_In_3|) (<= 0 (+ v_~sum2~0_Out_38 2147483648)) (<= .cse8 2147483647) (<= v_~sum2~0_Out_38 2147483647) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30| v_~bag2~0_In_21) .cse0 .cse1 .cse2 (= v_~sum2~0_In_17 |v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30|) (<= 0 (+ .cse3 v_~bag2~0_In_21 2147483648)) .cse4 (= v_~sum2~0_Out_38 |v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|) (= |v_thread2Thread1of1ForFork1_#t~mem11#1_Out_22| |v_thread2Thread1of1ForFork1_#t~mem11#1_In_3|) .cse5 (<= v_~cap2~0_In_6 .cse8) .cse6 .cse7 (= .cse3 v_~bag2~0_Out_34))))) InVars {~A~0.base=v_~A~0.base_In_27, ~j~0=v_~j~0_In_28, ~bag2~0=v_~bag2~0_In_21, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_In_3|, ~sum2~0=v_~sum2~0_In_17, ~N~0=v_~N~0_In_10, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_In_3|, ~A~0.offset=v_~A~0.offset_In_27, ~cap2~0=v_~cap2~0_In_6, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_In_2|, #memory_int=|v_#memory_int_In_42|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_In_3|} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_Out_30|, ~A~0.base=v_~A~0.base_In_27, ~j~0=v_~j~0_Out_34, thread2Thread1of1ForFork1_#t~post15#1=|v_thread2Thread1of1ForFork1_#t~post15#1_Out_18|, ~bag2~0=v_~bag2~0_Out_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_Out_40|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_Out_22|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_72|, ~sum2~0=v_~sum2~0_Out_38, thread2Thread1of1ForFork1_#t~ret13#1=|v_thread2Thread1of1ForFork1_#t~ret13#1_Out_14|, ~N~0=v_~N~0_In_10, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_Out_30|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_88|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_Out_22|, ~A~0.offset=v_~A~0.offset_In_27, thread2Thread1of1ForFork1_#t~mem14#1=|v_thread2Thread1of1ForFork1_#t~mem14#1_Out_20|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_Out_70|, ~cap2~0=v_~cap2~0_In_6, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_Out_44|, thread2Thread1of1ForFork1_#t~ret10#1=|v_thread2Thread1of1ForFork1_#t~ret10#1_Out_24|, #memory_int=|v_#memory_int_In_42|, thread2Thread1of1ForFork1_#t~ret12#1=|v_thread2Thread1of1ForFork1_#t~ret12#1_Out_14|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, ~j~0, thread2Thread1of1ForFork1_#t~post15#1, ~bag2~0, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~sum2~0, thread2Thread1of1ForFork1_#t~ret13#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem14#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#t~ret10#1, thread2Thread1of1ForFork1_#t~ret12#1] [2022-12-06 05:18:22,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:18:22,732 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:18:22,736 INFO L158 Benchmark]: Toolchain (without parser) took 40198.57ms. Allocated memory was 182.5MB in the beginning and 528.5MB in the end (delta: 346.0MB). Free memory was 147.1MB in the beginning and 282.3MB in the end (delta: -135.2MB). Peak memory consumption was 211.9MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,736 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:18:22,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.41ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 135.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.02ms. Allocated memory is still 182.5MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,737 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,737 INFO L158 Benchmark]: RCFGBuilder took 523.18ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 106.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,737 INFO L158 Benchmark]: TraceAbstraction took 39382.82ms. Allocated memory was 182.5MB in the beginning and 528.5MB in the end (delta: 346.0MB). Free memory was 105.7MB in the beginning and 282.3MB in the end (delta: -176.6MB). Peak memory consumption was 171.0MB. Max. memory is 8.0GB. [2022-12-06 05:18:22,738 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 182.5MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.41ms. Allocated memory is still 182.5MB. Free memory was 147.1MB in the beginning and 135.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.02ms. Allocated memory is still 182.5MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.18ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 106.2MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 39382.82ms. Allocated memory was 182.5MB in the beginning and 528.5MB in the end (delta: 346.0MB). Free memory was 105.7MB in the beginning and 282.3MB in the end (delta: -176.6MB). Peak memory consumption was 171.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9s, 305 PlacesBefore, 20 PlacesAfterwards, 326 TransitionsBefore, 16 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 91 TrivialYvCompositions, 194 ConcurrentYvCompositions, 25 ChoiceCompositions, 310 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 17021, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17040, independent: 17021, independent conditional: 0, independent unconditional: 17021, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15363, independent: 15348, independent conditional: 0, independent unconditional: 15348, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17040, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15363, unknown conditional: 0, unknown unconditional: 15363] , Statistics on independence cache: Total cache size (in pairs): 34757, Positive cache size: 34742, Positive conditional cache size: 0, Positive unconditional cache size: 34742, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: 2.4s, 23 PlacesBefore, 23 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 2.1s, 29 PlacesBefore, 29 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 30, independent: 21, independent conditional: 16, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 13, Positive conditional cache size: 12, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 33 PlacesBefore, 33 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 13, Positive conditional cache size: 12, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 2.2s, 38 PlacesBefore, 38 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 40, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 50, independent conditional: 40, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 50, independent conditional: 40, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 60, independent: 50, independent conditional: 40, independent unconditional: 10, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 13, Positive conditional cache size: 12, Positive unconditional cache size: 1, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 37 PlacesBefore, 37 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 25, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 15, Positive conditional cache size: 13, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 37 PlacesBefore, 37 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 15, Positive conditional cache size: 13, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 4.2s, 56 PlacesBefore, 54 PlacesAfterwards, 66 TransitionsBefore, 64 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 21, independent conditional: 13, independent unconditional: 8, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 14, independent conditional: 7, independent unconditional: 7, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 22, Positive conditional cache size: 19, Positive unconditional cache size: 3, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_313 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:18:22,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...