/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 12:35:14,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 12:35:14,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 12:35:14,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 12:35:14,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 12:35:14,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 12:35:14,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 12:35:14,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 12:35:14,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 12:35:14,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 12:35:14,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 12:35:14,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 12:35:14,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 12:35:14,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 12:35:14,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 12:35:14,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 12:35:14,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 12:35:14,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 12:35:14,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 12:35:14,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 12:35:14,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 12:35:14,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 12:35:14,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 12:35:14,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 12:35:14,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 12:35:14,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 12:35:14,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 12:35:14,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 12:35:14,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 12:35:14,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 12:35:14,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 12:35:14,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 12:35:14,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 12:35:14,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 12:35:14,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 12:35:14,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 12:35:14,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 12:35:14,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 12:35:14,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 12:35:14,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 12:35:14,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 12:35:14,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 12:35:14,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 12:35:14,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 12:35:14,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 12:35:14,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 12:35:14,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 12:35:14,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 12:35:14,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 12:35:14,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:35:14,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 12:35:14,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 12:35:14,375 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 12:35:14,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 12:35:14,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 12:35:14,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 12:35:14,375 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 12:35:14,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 12:35:14,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 12:35:14,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 12:35:14,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 12:35:14,676 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 12:35:14,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-12 12:35:15,586 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 12:35:15,778 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 12:35:15,778 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c [2022-12-12 12:35:15,783 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758ff3133/b9820a827b364811b7e2e7bf47109f01/FLAGa6087e424 [2022-12-12 12:35:15,794 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758ff3133/b9820a827b364811b7e2e7bf47109f01 [2022-12-12 12:35:15,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 12:35:15,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 12:35:15,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 12:35:15,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 12:35:15,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 12:35:15,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:35:15" (1/1) ... [2022-12-12 12:35:15,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440ebf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:15, skipping insertion in model container [2022-12-12 12:35:15,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:35:15" (1/1) ... [2022-12-12 12:35:15,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 12:35:15,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 12:35:15,990 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-12 12:35:15,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:35:16,003 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 12:35:16,033 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-trans.wvr.c[4788,4801] [2022-12-12 12:35:16,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 12:35:16,050 INFO L208 MainTranslator]: Completed translation [2022-12-12 12:35:16,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16 WrapperNode [2022-12-12 12:35:16,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 12:35:16,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 12:35:16,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 12:35:16,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 12:35:16,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,101 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 297 [2022-12-12 12:35:16,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 12:35:16,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 12:35:16,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 12:35:16,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 12:35:16,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 12:35:16,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 12:35:16,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 12:35:16,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 12:35:16,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (1/1) ... [2022-12-12 12:35:16,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 12:35:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:35:16,187 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-12 12:35:16,190 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-12 12:35:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 12:35:16,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 12:35:16,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 12:35:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 12:35:16,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 12:35:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 12:35:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 12:35:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 12:35:16,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 12:35:16,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 12:35:16,246 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 12:35:16,373 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 12:35:16,374 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 12:35:16,744 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 12:35:16,753 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 12:35:16,753 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 12:35:16,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:35:16 BoogieIcfgContainer [2022-12-12 12:35:16,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 12:35:16,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 12:35:16,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 12:35:16,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 12:35:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:35:15" (1/3) ... [2022-12-12 12:35:16,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cc7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:35:16, skipping insertion in model container [2022-12-12 12:35:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:35:16" (2/3) ... [2022-12-12 12:35:16,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cc7b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:35:16, skipping insertion in model container [2022-12-12 12:35:16,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:35:16" (3/3) ... [2022-12-12 12:35:16,759 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2022-12-12 12:35:16,771 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 12:35:16,771 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 12:35:16,771 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 12:35:16,837 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 12:35:16,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 341 transitions, 706 flow [2022-12-12 12:35:17,020 INFO L130 PetriNetUnfolder]: 26/338 cut-off events. [2022-12-12 12:35:17,020 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 12:35:17,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 26/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-12-12 12:35:17,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 341 transitions, 706 flow [2022-12-12 12:35:17,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 328 transitions, 674 flow [2022-12-12 12:35:17,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 12:35:17,052 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7044269e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 12:35:17,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 12:35:17,107 INFO L130 PetriNetUnfolder]: 26/327 cut-off events. [2022-12-12 12:35:17,107 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 12:35:17,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:17,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:17,112 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1950208797, now seen corresponding path program 1 times [2022-12-12 12:35:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:17,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890888314] [2022-12-12 12:35:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:17,387 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-12 12:35:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:17,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890888314] [2022-12-12 12:35:17,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890888314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:17,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:17,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 12:35:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792040298] [2022-12-12 12:35:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:17,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 12:35:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 12:35:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 12:35:17,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2022-12-12 12:35:17,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 328 transitions, 674 flow. Second operand has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-12 12:35:17,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:17,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2022-12-12 12:35:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:17,521 INFO L130 PetriNetUnfolder]: 7/309 cut-off events. [2022-12-12 12:35:17,521 INFO L131 PetriNetUnfolder]: For 12/14 co-relation queries the response was YES. [2022-12-12 12:35:17,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 309 events. 7/309 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 753 event pairs, 0 based on Foata normal form. 38/325 useless extension candidates. Maximal degree in co-relation 239. Up to 7 conditions per place. [2022-12-12 12:35:17,527 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 6 selfloop transitions, 0 changer transitions 3/309 dead transitions. [2022-12-12 12:35:17,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 309 transitions, 648 flow [2022-12-12 12:35:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 12:35:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 12:35:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 655 transitions. [2022-12-12 12:35:17,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9604105571847508 [2022-12-12 12:35:17,548 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 1 predicate places. [2022-12-12 12:35:17,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 309 transitions, 648 flow [2022-12-12 12:35:17,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 624 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-12 12:35:17,554 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 624 flow [2022-12-12 12:35:17,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-12 12:35:17,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:17,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 12:35:17,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:17,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash 648841092, now seen corresponding path program 1 times [2022-12-12 12:35:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:17,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256110035] [2022-12-12 12:35:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:17,892 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-12 12:35:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:17,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256110035] [2022-12-12 12:35:17,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256110035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:17,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:17,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 12:35:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944864428] [2022-12-12 12:35:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 12:35:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 12:35:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 12:35:17,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-12-12 12:35:17,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 624 flow. Second operand has 5 states, 5 states have (on average 305.8) internal successors, (1529), 5 states have internal predecessors, (1529), 0 states have call successors, (0), 0 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-12 12:35:17,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:17,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-12-12 12:35:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:17,980 INFO L130 PetriNetUnfolder]: 7/315 cut-off events. [2022-12-12 12:35:17,980 INFO L131 PetriNetUnfolder]: For 3/5 co-relation queries the response was YES. [2022-12-12 12:35:17,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 315 events. 7/315 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 746 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 174. Up to 16 conditions per place. [2022-12-12 12:35:17,983 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 18 selfloop transitions, 4 changer transitions 3/313 dead transitions. [2022-12-12 12:35:17,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 313 transitions, 676 flow [2022-12-12 12:35:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 12:35:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 12:35:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1538 transitions. [2022-12-12 12:35:17,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9020527859237537 [2022-12-12 12:35:17,989 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, -2 predicate places. [2022-12-12 12:35:17,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 313 transitions, 676 flow [2022-12-12 12:35:17,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 313 transitions, 653 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-12 12:35:17,991 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 313 transitions, 653 flow [2022-12-12 12:35:17,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.8) internal successors, (1529), 5 states have internal predecessors, (1529), 0 states have call successors, (0), 0 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-12 12:35:17,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:17,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:17,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 12:35:17,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 450840716, now seen corresponding path program 1 times [2022-12-12 12:35:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:17,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236797488] [2022-12-12 12:35:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:35:18,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236797488] [2022-12-12 12:35:18,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236797488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 12:35:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155330061] [2022-12-12 12:35:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:18,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 12:35:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 12:35:18,267 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-12 12:35:18,268 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-12 12:35:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:18,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 12:35:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 12:35:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:35:18,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 12:35:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 12:35:18,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155330061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 12:35:18,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 12:35:18,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-12-12 12:35:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138342736] [2022-12-12 12:35:18,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 12:35:18,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 12:35:18,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:18,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 12:35:18,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-12 12:35:18,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 341 [2022-12-12 12:35:18,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 313 transitions, 653 flow. Second operand has 14 states, 14 states have (on average 304.7857142857143) internal successors, (4267), 14 states have internal predecessors, (4267), 0 states have call successors, (0), 0 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-12 12:35:18,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:18,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 341 [2022-12-12 12:35:18,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:18,776 INFO L130 PetriNetUnfolder]: 7/324 cut-off events. [2022-12-12 12:35:18,776 INFO L131 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2022-12-12 12:35:18,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 324 events. 7/324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 738 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 218. Up to 13 conditions per place. [2022-12-12 12:35:18,779 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 19 selfloop transitions, 11 changer transitions 3/320 dead transitions. [2022-12-12 12:35:18,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 737 flow [2022-12-12 12:35:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 12:35:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 12:35:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3354 transitions. [2022-12-12 12:35:18,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8941615569181551 [2022-12-12 12:35:18,784 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 6 predicate places. [2022-12-12 12:35:18,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 737 flow [2022-12-12 12:35:18,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 320 transitions, 683 flow, removed 23 selfloop flow, removed 4 redundant places. [2022-12-12 12:35:18,786 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 320 transitions, 683 flow [2022-12-12 12:35:18,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 304.7857142857143) internal successors, (4267), 14 states have internal predecessors, (4267), 0 states have call successors, (0), 0 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-12 12:35:18,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:18,789 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:18,799 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-12 12:35:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 12:35:18,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1525883276, now seen corresponding path program 2 times [2022-12-12 12:35:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:18,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133951820] [2022-12-12 12:35:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:35:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:19,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133951820] [2022-12-12 12:35:19,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133951820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:19,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:35:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452878768] [2022-12-12 12:35:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:35:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:35:19,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:35:19,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 341 [2022-12-12 12:35:19,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 320 transitions, 683 flow. Second operand has 9 states, 9 states have (on average 270.22222222222223) internal successors, (2432), 9 states have internal predecessors, (2432), 0 states have call successors, (0), 0 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-12 12:35:19,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:19,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 341 [2022-12-12 12:35:19,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:20,617 INFO L130 PetriNetUnfolder]: 2519/10416 cut-off events. [2022-12-12 12:35:20,617 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-12 12:35:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14254 conditions, 10416 events. 2519/10416 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 119407 event pairs, 1262 based on Foata normal form. 0/9352 useless extension candidates. Maximal degree in co-relation 14100. Up to 1390 conditions per place. [2022-12-12 12:35:20,674 INFO L137 encePairwiseOnDemand]: 322/341 looper letters, 120 selfloop transitions, 14 changer transitions 9/408 dead transitions. [2022-12-12 12:35:20,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 408 transitions, 1161 flow [2022-12-12 12:35:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 12:35:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 12:35:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3336 transitions. [2022-12-12 12:35:20,678 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8152492668621701 [2022-12-12 12:35:20,679 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 13 predicate places. [2022-12-12 12:35:20,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 408 transitions, 1161 flow [2022-12-12 12:35:20,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 408 transitions, 1133 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-12 12:35:20,682 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 408 transitions, 1133 flow [2022-12-12 12:35:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 270.22222222222223) internal successors, (2432), 9 states have internal predecessors, (2432), 0 states have call successors, (0), 0 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-12 12:35:20,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:20,684 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:20,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 12:35:20,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash -288781881, now seen corresponding path program 1 times [2022-12-12 12:35:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:20,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726740569] [2022-12-12 12:35:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:35:20,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:20,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726740569] [2022-12-12 12:35:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726740569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:20,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:20,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:35:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101374329] [2022-12-12 12:35:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:20,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:35:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:35:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:35:20,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:35:20,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 408 transitions, 1133 flow. Second operand has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:20,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:20,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:35:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:24,994 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L85-1-->L85-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_1| v_~name_2~0_6) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_1| v_~name_3~0_1)) InVars {~name_2~0=v_~name_2~0_6, ~name_3~0=v_~name_3~0_1} OutVars{~name_2~0=v_~name_2~0_6, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_1|, ~name_3~0=v_~name_3~0_1, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1][765], [1547#(and (= ~break_15~0 0) (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 316#L93true, 12#L136-4true, 190#L85-2true, 1499#(= ~break_7~0 0), 307#L63-9true]) [2022-12-12 12:35:24,994 INFO L382 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-12-12 12:35:24,994 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([916] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_6 v_~name_3~0_6) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_6, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_6} OutVars{~name_3~0=v_~name_3~0_6, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[~result_12~0][700], [1547#(and (= ~break_15~0 0) (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 116#L94true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 12#L136-4true, 1499#(= ~break_7~0 0), 307#L63-9true, 204#L85-1true]) [2022-12-12 12:35:24,995 INFO L382 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:24,995 INFO L385 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-12-12 12:35:25,075 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L85-1-->L85-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_1| v_~name_2~0_6) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_1| v_~name_3~0_1)) InVars {~name_2~0=v_~name_2~0_6, ~name_3~0=v_~name_3~0_1} OutVars{~name_2~0=v_~name_2~0_6, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_1|, ~name_3~0=v_~name_3~0_1, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1][765], [1547#(and (= ~break_15~0 0) (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 316#L93true, 12#L136-4true, 137#L63-10true, 1499#(= ~break_7~0 0), 190#L85-2true]) [2022-12-12 12:35:25,076 INFO L382 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([916] L93-->L94: Formula: (= v_~result_12~0_3 (ite (= v_~name_1~0_6 v_~name_3~0_6) 0 v_~result_12~0_4)) InVars {~name_3~0=v_~name_3~0_6, ~result_12~0=v_~result_12~0_4, ~name_1~0=v_~name_1~0_6} OutVars{~name_3~0=v_~name_3~0_6, ~result_12~0=v_~result_12~0_3, ~name_1~0=v_~name_1~0_6} AuxVars[] AssignedVars[~result_12~0][700], [1547#(and (= ~break_15~0 0) (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 116#L94true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 12#L136-4true, 137#L63-10true, 1499#(= ~break_7~0 0), 204#L85-1true]) [2022-12-12 12:35:25,076 INFO L382 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,076 INFO L385 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-12-12 12:35:25,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] thread1EXIT-->L137-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][742], [1547#(and (= ~break_15~0 0) (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 297#L137-2true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 316#L93true, 1499#(= ~break_7~0 0), 204#L85-1true]) [2022-12-12 12:35:25,511 INFO L382 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-12-12 12:35:25,512 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-12 12:35:25,512 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-12 12:35:25,512 INFO L385 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-12-12 12:35:26,617 INFO L130 PetriNetUnfolder]: 13365/54337 cut-off events. [2022-12-12 12:35:26,617 INFO L131 PetriNetUnfolder]: For 9315/11145 co-relation queries the response was YES. [2022-12-12 12:35:26,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88850 conditions, 54337 events. 13365/54337 cut-off events. For 9315/11145 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 803470 event pairs, 769 based on Foata normal form. 318/49030 useless extension candidates. Maximal degree in co-relation 88696. Up to 4982 conditions per place. [2022-12-12 12:35:26,959 INFO L137 encePairwiseOnDemand]: 324/341 looper letters, 450 selfloop transitions, 123 changer transitions 19/866 dead transitions. [2022-12-12 12:35:26,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 866 transitions, 3966 flow [2022-12-12 12:35:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-12 12:35:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-12 12:35:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5154 transitions. [2022-12-12 12:35:26,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8396871945259042 [2022-12-12 12:35:26,980 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 29 predicate places. [2022-12-12 12:35:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 866 transitions, 3966 flow [2022-12-12 12:35:26,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 866 transitions, 3948 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-12 12:35:26,990 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 866 transitions, 3948 flow [2022-12-12 12:35:26,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:26,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:26,992 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:26,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 12:35:26,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -297585441, now seen corresponding path program 2 times [2022-12-12 12:35:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:26,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149569535] [2022-12-12 12:35:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:35:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149569535] [2022-12-12 12:35:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149569535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:27,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:27,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:35:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060219189] [2022-12-12 12:35:27,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:35:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:35:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:35:27,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:35:27,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 866 transitions, 3948 flow. Second operand has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:27,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:27,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:35:27,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:34,762 INFO L130 PetriNetUnfolder]: 17294/70010 cut-off events. [2022-12-12 12:35:34,762 INFO L131 PetriNetUnfolder]: For 27362/39259 co-relation queries the response was YES. [2022-12-12 12:35:34,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138704 conditions, 70010 events. 17294/70010 cut-off events. For 27362/39259 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 1064307 event pairs, 1124 based on Foata normal form. 1507/64074 useless extension candidates. Maximal degree in co-relation 138545. Up to 6281 conditions per place. [2022-12-12 12:35:35,181 INFO L137 encePairwiseOnDemand]: 324/341 looper letters, 916 selfloop transitions, 190 changer transitions 41/1421 dead transitions. [2022-12-12 12:35:35,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1421 transitions, 9452 flow [2022-12-12 12:35:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 12:35:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 12:35:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3472 transitions. [2022-12-12 12:35:35,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8484848484848485 [2022-12-12 12:35:35,189 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 40 predicate places. [2022-12-12 12:35:35,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1421 transitions, 9452 flow [2022-12-12 12:35:35,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 1421 transitions, 9020 flow, removed 216 selfloop flow, removed 0 redundant places. [2022-12-12 12:35:35,209 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 1421 transitions, 9020 flow [2022-12-12 12:35:35,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:35,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:35,212 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:35,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 12:35:35,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1711228405, now seen corresponding path program 3 times [2022-12-12 12:35:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146058497] [2022-12-12 12:35:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:35:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:35,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146058497] [2022-12-12 12:35:35,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146058497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:35,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:35,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:35:35,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086998320] [2022-12-12 12:35:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:35:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:35:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:35:35,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:35:35,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 1421 transitions, 9020 flow. Second operand has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:35,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:35,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:35:35,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:35:45,641 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L85-1-->L85-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_1| v_~name_2~0_6) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_1| v_~name_3~0_1)) InVars {~name_2~0=v_~name_2~0_6, ~name_3~0=v_~name_3~0_1} OutVars{~name_2~0=v_~name_2~0_6, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_1|, ~name_3~0=v_~name_3~0_1, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1][2203], [1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1499#(= ~break_7~0 0), 190#L85-2true, 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 12#L136-4true, 137#L63-10true, 284#L107-7true, 1552#(= ~break_11~0 0)]) [2022-12-12 12:35:45,641 INFO L382 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] thread1EXIT-->L137-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1994], [1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 297#L137-2true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1499#(= ~break_7~0 0), 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 284#L107-7true, 204#L85-1true, 1552#(= ~break_11~0 0)]) [2022-12-12 12:35:45,642 INFO L382 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-12-12 12:35:45,642 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:35:46,967 INFO L130 PetriNetUnfolder]: 25085/94573 cut-off events. [2022-12-12 12:35:46,967 INFO L131 PetriNetUnfolder]: For 67109/89492 co-relation queries the response was YES. [2022-12-12 12:35:47,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222363 conditions, 94573 events. 25085/94573 cut-off events. For 67109/89492 co-relation queries the response was YES. Maximal size of possible extension queue 2632. Compared 1464917 event pairs, 1329 based on Foata normal form. 1524/85919 useless extension candidates. Maximal degree in co-relation 222199. Up to 11546 conditions per place. [2022-12-12 12:35:47,581 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 1541 selfloop transitions, 370 changer transitions 275/2457 dead transitions. [2022-12-12 12:35:47,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 2457 transitions, 20918 flow [2022-12-12 12:35:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-12 12:35:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-12 12:35:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6030 transitions. [2022-12-12 12:35:47,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8420611646418098 [2022-12-12 12:35:47,590 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 60 predicate places. [2022-12-12 12:35:47,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 2457 transitions, 20918 flow [2022-12-12 12:35:47,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 2457 transitions, 19686 flow, removed 616 selfloop flow, removed 0 redundant places. [2022-12-12 12:35:47,644 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 2457 transitions, 19686 flow [2022-12-12 12:35:47,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:35:47,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:35:47,645 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:35:47,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 12:35:47,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:35:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:35:47,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1858263143, now seen corresponding path program 4 times [2022-12-12 12:35:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:35:47,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200748401] [2022-12-12 12:35:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:35:47,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:35:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:35:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:35:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:35:48,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200748401] [2022-12-12 12:35:48,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200748401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:35:48,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:35:48,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 12:35:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341852646] [2022-12-12 12:35:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:35:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 12:35:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:35:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 12:35:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-12 12:35:48,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:35:48,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 2457 transitions, 19686 flow. Second operand has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 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-12 12:35:48,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:35:48,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:35:48,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:36:03,834 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L85-1-->L85-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_1| v_~name_2~0_6) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_1| v_~name_3~0_1)) InVars {~name_2~0=v_~name_2~0_6, ~name_3~0=v_~name_3~0_1} OutVars{~name_2~0=v_~name_2~0_6, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_1|, ~name_3~0=v_~name_3~0_1, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1][3133], [1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 137#L63-10true, 190#L85-2true, 12#L136-4true, 1499#(= ~break_7~0 0), 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 284#L107-7true, 1624#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 1552#(= ~break_11~0 0)]) [2022-12-12 12:36:03,834 INFO L382 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-12-12 12:36:03,834 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:36:03,834 INFO L385 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-12-12 12:36:03,834 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:36:03,834 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] thread1EXIT-->L137-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2783], [1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 297#L137-2true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1499#(= ~break_7~0 0), 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 284#L107-7true, 1624#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 204#L85-1true, 1552#(= ~break_11~0 0)]) [2022-12-12 12:36:03,834 INFO L382 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-12-12 12:36:03,834 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:36:03,835 INFO L385 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-12-12 12:36:03,835 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:36:05,930 INFO L130 PetriNetUnfolder]: 34946/132191 cut-off events. [2022-12-12 12:36:05,931 INFO L131 PetriNetUnfolder]: For 134868/184218 co-relation queries the response was YES. [2022-12-12 12:36:06,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341884 conditions, 132191 events. 34946/132191 cut-off events. For 134868/184218 co-relation queries the response was YES. Maximal size of possible extension queue 3737. Compared 2149201 event pairs, 1628 based on Foata normal form. 2550/121949 useless extension candidates. Maximal degree in co-relation 341715. Up to 15256 conditions per place. [2022-12-12 12:36:07,064 INFO L137 encePairwiseOnDemand]: 324/341 looper letters, 2357 selfloop transitions, 445 changer transitions 440/3513 dead transitions. [2022-12-12 12:36:07,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 3513 transitions, 35427 flow [2022-12-12 12:36:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 12:36:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 12:36:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4311 transitions. [2022-12-12 12:36:07,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8428152492668621 [2022-12-12 12:36:07,071 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 74 predicate places. [2022-12-12 12:36:07,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 3513 transitions, 35427 flow [2022-12-12 12:36:07,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 3513 transitions, 34097 flow, removed 595 selfloop flow, removed 4 redundant places. [2022-12-12 12:36:07,284 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 3513 transitions, 34097 flow [2022-12-12 12:36:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 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-12 12:36:07,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:36:07,285 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:36:07,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 12:36:07,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:36:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:36:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2015416057, now seen corresponding path program 5 times [2022-12-12 12:36:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:36:07,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033112494] [2022-12-12 12:36:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:36:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:36:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:36:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:36:07,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:36:07,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033112494] [2022-12-12 12:36:07,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033112494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:36:07,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:36:07,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 12:36:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100415611] [2022-12-12 12:36:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:36:07,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 12:36:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:36:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 12:36:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-12 12:36:07,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:36:07,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 3513 transitions, 34097 flow. Second operand has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 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-12 12:36:07,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:36:07,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:36:07,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 12:36:26,432 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L85-1-->L85-2: Formula: (and (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_1| v_~name_2~0_6) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_1| v_~name_3~0_1)) InVars {~name_2~0=v_~name_2~0_6, ~name_3~0=v_~name_3~0_1} OutVars{~name_2~0=v_~name_2~0_6, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_1|, ~name_3~0=v_~name_3~0_1, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1][3217], [1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 1656#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 12#L136-4true, 1499#(= ~break_7~0 0), 190#L85-2true, 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 137#L63-10true, 284#L107-7true, 1624#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 1552#(= ~break_11~0 0)]) [2022-12-12 12:36:26,433 INFO L382 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([982] thread1EXIT-->L137-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2833], [1656#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 1524#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0))) (= ~break_11~0 0)), 297#L137-2true, 1482#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1606#(and (or (<= ~name_3~0 ~name_1~0) (not (<= (+ ~name_1~0 1) ~name_2~0))) (or (<= ~name_1~0 ~name_2~0) (<= ~name_1~0 ~name_3~0)) (= ~break_11~0 0) (or (= ~break_15~0 0) (= ~break_15~0 1))), 1499#(= ~break_7~0 0), 284#L107-7true, 1624#(and (or (<= (+ ~name_1~0 1) ~name_2~0) (not (<= ~name_1~0 ~name_2~0)) (= ~break_7~0 1)) (= ~break_11~0 0)), 204#L85-1true, 1552#(= ~break_11~0 0)]) [2022-12-12 12:36:26,433 INFO L382 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:36:26,433 INFO L385 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-12-12 12:36:29,131 INFO L130 PetriNetUnfolder]: 35462/134641 cut-off events. [2022-12-12 12:36:29,131 INFO L131 PetriNetUnfolder]: For 198131/255290 co-relation queries the response was YES. [2022-12-12 12:36:29,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390437 conditions, 134641 events. 35462/134641 cut-off events. For 198131/255290 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 2194700 event pairs, 2099 based on Foata normal form. 2747/124587 useless extension candidates. Maximal degree in co-relation 390268. Up to 15311 conditions per place. [2022-12-12 12:36:30,458 INFO L137 encePairwiseOnDemand]: 323/341 looper letters, 2406 selfloop transitions, 494 changer transitions 459/3630 dead transitions. [2022-12-12 12:36:30,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 3630 transitions, 42045 flow [2022-12-12 12:36:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 12:36:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 12:36:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 4341 transitions. [2022-12-12 12:36:30,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8486803519061583 [2022-12-12 12:36:30,485 INFO L295 CegarLoopForPetriNet]: 312 programPoint places, 84 predicate places. [2022-12-12 12:36:30,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 3630 transitions, 42045 flow [2022-12-12 12:36:30,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 3630 transitions, 36734 flow, removed 2291 selfloop flow, removed 10 redundant places. [2022-12-12 12:36:30,664 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 3630 transitions, 36734 flow [2022-12-12 12:36:30,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 270.4) internal successors, (2704), 10 states have internal predecessors, (2704), 0 states have call successors, (0), 0 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-12 12:36:30,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 12:36:30,665 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 12:36:30,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 12:36:30,665 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 12:36:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 12:36:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1374228849, now seen corresponding path program 6 times [2022-12-12 12:36:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 12:36:30,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075898972] [2022-12-12 12:36:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 12:36:30,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 12:36:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 12:36:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-12 12:36:30,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 12:36:30,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075898972] [2022-12-12 12:36:30,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075898972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 12:36:30,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 12:36:30,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 12:36:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134392486] [2022-12-12 12:36:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 12:36:30,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 12:36:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 12:36:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 12:36:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-12 12:36:30,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 341 [2022-12-12 12:36:30,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 3630 transitions, 36734 flow. Second operand has 9 states, 9 states have (on average 270.77777777777777) internal successors, (2437), 9 states have internal predecessors, (2437), 0 states have call successors, (0), 0 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-12 12:36:30,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 12:36:30,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 341 [2022-12-12 12:36:30,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand