/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/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 13:05:12,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:05:12,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:05:12,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:05:12,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:05:12,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:05:12,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:05:12,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:05:12,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:05:12,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:05:12,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:05:12,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:05:12,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:05:12,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:05:12,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:05:12,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:05:12,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:05:12,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:05:12,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:05:12,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:05:12,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:05:12,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:05:12,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:05:12,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:05:12,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:05:12,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:05:12,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:05:12,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:05:12,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:05:12,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:05:12,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:05:12,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:05:12,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:05:12,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:05:12,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:05:12,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:05:12,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:05:12,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:05:12,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:05:12,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:05:12,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:05:12,344 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 13:05:12,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:05:12,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:05:12,371 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:05:12,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:05:12,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:05:12,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:05:12,372 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:05:12,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:05:12,372 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:05:12,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:05:12,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:05:12,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:05:12,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:05:12,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:05:12,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:05:12,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:05:12,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:05:12,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:05:12,375 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:05:12,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 13:05:12,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:05:12,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:05:12,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:05:12,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:05:12,641 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:05:12,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-12-12 13:05:13,554 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:05:13,732 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:05:13,732 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-12-12 13:05:13,748 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f08d84f/5f4f5d603a5b4fac9a437cb06a2a8f57/FLAGbcf8e1718 [2022-12-12 13:05:13,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f08d84f/5f4f5d603a5b4fac9a437cb06a2a8f57 [2022-12-12 13:05:13,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:05:13,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:05:13,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:05:13,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:05:13,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:05:13,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ce8e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13, skipping insertion in model container [2022-12-12 13:05:13,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:05:13,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:05:13,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,895 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/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-12 13:05:13,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:05:13,909 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:05:13,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:05:13,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:05:13,922 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/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-12 13:05:13,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:05:13,934 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:05:13,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13 WrapperNode [2022-12-12 13:05:13,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:05:13,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:05:13,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:05:13,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:05:13,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,977 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-12 13:05:13,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:05:13,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:05:13,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:05:13,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:05:13,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:13,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:05:14,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:05:14,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:05:14,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:05:14,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (1/1) ... [2022-12-12 13:05:14,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:05:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:05:14,042 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 13:05:14,048 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 13:05:14,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:05:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:05:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:05:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:05:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:05:14,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:05:14,075 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:05:14,075 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:05:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:05:14,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:05:14,077 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 13:05:14,208 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:05:14,209 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:05:14,430 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:05:14,519 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:05:14,519 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 13:05:14,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:05:14 BoogieIcfgContainer [2022-12-12 13:05:14,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:05:14,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:05:14,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:05:14,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:05:14,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:05:13" (1/3) ... [2022-12-12 13:05:14,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd35141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:05:14, skipping insertion in model container [2022-12-12 13:05:14,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:05:13" (2/3) ... [2022-12-12 13:05:14,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd35141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:05:14, skipping insertion in model container [2022-12-12 13:05:14,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:05:14" (3/3) ... [2022-12-12 13:05:14,527 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-12-12 13:05:14,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:05:14,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:05:14,541 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:05:14,579 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 13:05:14,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 234 flow [2022-12-12 13:05:14,643 INFO L130 PetriNetUnfolder]: 9/107 cut-off events. [2022-12-12 13:05:14,644 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:05:14,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 107 events. 9/107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 13:05:14,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 109 transitions, 234 flow [2022-12-12 13:05:14,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 210 flow [2022-12-12 13:05:14,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:05:14,663 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;@11a3059, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:05:14,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 13:05:14,695 INFO L130 PetriNetUnfolder]: 9/98 cut-off events. [2022-12-12 13:05:14,695 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:05:14,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:14,696 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] [2022-12-12 13:05:14,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1980256759, now seen corresponding path program 1 times [2022-12-12 13:05:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:14,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812986355] [2022-12-12 13:05:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:15,164 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 13:05:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:15,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812986355] [2022-12-12 13:05:15,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812986355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:05:15,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:05:15,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:05:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911951958] [2022-12-12 13:05:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:05:15,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:05:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:05:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:05:15,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2022-12-12 13:05:15,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 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 13:05:15,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:15,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2022-12-12 13:05:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:15,413 INFO L130 PetriNetUnfolder]: 26/185 cut-off events. [2022-12-12 13:05:15,413 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-12 13:05:15,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 185 events. 26/185 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 514 event pairs, 3 based on Foata normal form. 23/192 useless extension candidates. Maximal degree in co-relation 140. Up to 41 conditions per place. [2022-12-12 13:05:15,417 INFO L137 encePairwiseOnDemand]: 94/109 looper letters, 24 selfloop transitions, 3 changer transitions 8/104 dead transitions. [2022-12-12 13:05:15,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 299 flow [2022-12-12 13:05:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:05:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:05:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 591 transitions. [2022-12-12 13:05:15,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7745740498034076 [2022-12-12 13:05:15,437 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 6 predicate places. [2022-12-12 13:05:15,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 104 transitions, 299 flow [2022-12-12 13:05:15,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 267 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-12 13:05:15,444 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 267 flow [2022-12-12 13:05:15,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 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 13:05:15,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:15,445 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] [2022-12-12 13:05:15,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:05:15,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1221264519, now seen corresponding path program 1 times [2022-12-12 13:05:15,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:15,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451661890] [2022-12-12 13:05:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:05:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:15,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451661890] [2022-12-12 13:05:15,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451661890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:05:15,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:05:15,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 13:05:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539888411] [2022-12-12 13:05:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:05:15,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:05:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:15,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:05:15,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 13:05:15,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-12 13:05:15,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 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 13:05:15,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:15,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-12 13:05:15,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:15,799 INFO L130 PetriNetUnfolder]: 99/422 cut-off events. [2022-12-12 13:05:15,799 INFO L131 PetriNetUnfolder]: For 89/107 co-relation queries the response was YES. [2022-12-12 13:05:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 422 events. 99/422 cut-off events. For 89/107 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1946 event pairs, 41 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 270. Up to 138 conditions per place. [2022-12-12 13:05:15,805 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 44 selfloop transitions, 8 changer transitions 9/126 dead transitions. [2022-12-12 13:05:15,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 126 transitions, 446 flow [2022-12-12 13:05:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:05:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:05:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 646 transitions. [2022-12-12 13:05:15,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7408256880733946 [2022-12-12 13:05:15,807 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 9 predicate places. [2022-12-12 13:05:15,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 126 transitions, 446 flow [2022-12-12 13:05:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 431 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-12 13:05:15,813 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 431 flow [2022-12-12 13:05:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 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 13:05:15,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:15,813 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] [2022-12-12 13:05:15,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 13:05:15,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:15,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1779798635, now seen corresponding path program 1 times [2022-12-12 13:05:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:15,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849914946] [2022-12-12 13:05:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:05:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:15,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849914946] [2022-12-12 13:05:15,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849914946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:05:15,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:05:15,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 13:05:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167798220] [2022-12-12 13:05:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:05:15,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:05:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:05:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-12 13:05:15,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-12 13:05:15,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 126 transitions, 431 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 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 13:05:15,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:15,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-12 13:05:15,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:16,034 INFO L130 PetriNetUnfolder]: 101/381 cut-off events. [2022-12-12 13:05:16,034 INFO L131 PetriNetUnfolder]: For 192/257 co-relation queries the response was YES. [2022-12-12 13:05:16,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 381 events. 101/381 cut-off events. For 192/257 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1633 event pairs, 55 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 223. Up to 162 conditions per place. [2022-12-12 13:05:16,036 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 29 selfloop transitions, 6 changer transitions 21/121 dead transitions. [2022-12-12 13:05:16,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 121 transitions, 494 flow [2022-12-12 13:05:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:05:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:05:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2022-12-12 13:05:16,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7362385321100917 [2022-12-12 13:05:16,039 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 13 predicate places. [2022-12-12 13:05:16,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 121 transitions, 494 flow [2022-12-12 13:05:16,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 121 transitions, 464 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-12 13:05:16,041 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 464 flow [2022-12-12 13:05:16,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 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 13:05:16,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:16,042 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] [2022-12-12 13:05:16,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 13:05:16,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -337098587, now seen corresponding path program 1 times [2022-12-12 13:05:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:16,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419377042] [2022-12-12 13:05:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419377042] [2022-12-12 13:05:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419377042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:05:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907374784] [2022-12-12 13:05:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:16,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:16,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:05:16,207 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 13:05:16,208 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 13:05:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:16,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 13:05:16,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:05:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:16,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:05:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907374784] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:05:16,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:05:16,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-12 13:05:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930547581] [2022-12-12 13:05:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:05:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:05:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:05:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-12 13:05:16,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-12 13:05:16,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 13:05:16,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:16,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-12 13:05:16,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:16,627 INFO L130 PetriNetUnfolder]: 93/352 cut-off events. [2022-12-12 13:05:16,627 INFO L131 PetriNetUnfolder]: For 315/453 co-relation queries the response was YES. [2022-12-12 13:05:16,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 352 events. 93/352 cut-off events. For 315/453 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1416 event pairs, 20 based on Foata normal form. 2/316 useless extension candidates. Maximal degree in co-relation 488. Up to 147 conditions per place. [2022-12-12 13:05:16,630 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 35 selfloop transitions, 7 changer transitions 20/127 dead transitions. [2022-12-12 13:05:16,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 127 transitions, 615 flow [2022-12-12 13:05:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:05:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:05:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2022-12-12 13:05:16,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7431192660550459 [2022-12-12 13:05:16,632 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2022-12-12 13:05:16,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 127 transitions, 615 flow [2022-12-12 13:05:16,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 127 transitions, 542 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-12 13:05:16,634 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 127 transitions, 542 flow [2022-12-12 13:05:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 13:05:16,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:16,635 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] [2022-12-12 13:05:16,643 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 13:05:16,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:16,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 231069697, now seen corresponding path program 1 times [2022-12-12 13:05:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:16,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286977651] [2022-12-12 13:05:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:16,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286977651] [2022-12-12 13:05:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286977651] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:05:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119530883] [2022-12-12 13:05:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:16,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:05:16,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:05:16,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 13:05:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:17,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 13:05:17,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:05:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:17,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:05:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:17,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119530883] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:05:17,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:05:17,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-12 13:05:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081749358] [2022-12-12 13:05:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:05:17,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 13:05:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:17,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 13:05:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-12 13:05:17,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-12 13:05:17,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 127 transitions, 542 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 13:05:17,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:17,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-12 13:05:17,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:17,297 INFO L130 PetriNetUnfolder]: 82/346 cut-off events. [2022-12-12 13:05:17,297 INFO L131 PetriNetUnfolder]: For 413/533 co-relation queries the response was YES. [2022-12-12 13:05:17,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 346 events. 82/346 cut-off events. For 413/533 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1302 event pairs, 19 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 262. Up to 126 conditions per place. [2022-12-12 13:05:17,299 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 41 selfloop transitions, 8 changer transitions 20/134 dead transitions. [2022-12-12 13:05:17,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 718 flow [2022-12-12 13:05:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:05:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:05:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2022-12-12 13:05:17,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7431192660550459 [2022-12-12 13:05:17,301 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2022-12-12 13:05:17,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 718 flow [2022-12-12 13:05:17,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 633 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-12 13:05:17,303 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 633 flow [2022-12-12 13:05:17,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 13:05:17,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:17,303 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] [2022-12-12 13:05:17,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 13:05:17,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:17,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -137393939, now seen corresponding path program 1 times [2022-12-12 13:05:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923107855] [2022-12-12 13:05:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:05:18,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:05:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923107855] [2022-12-12 13:05:18,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923107855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:05:18,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756050820] [2022-12-12 13:05:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:18,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:18,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:05:18,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:05:18,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 13:05:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:05:18,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 13:05:18,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:05:18,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 13:05:18,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 13:05:18,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 13:05:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-12 13:05:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:05:18,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:05:19,118 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_106 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset) c_~counter~0))) is different from false [2022-12-12 13:05:19,140 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork0_~tmp~0#1|)) (forall ((v_ArrVal_106 (Array Int Int))) (<= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-12-12 13:05:19,149 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0))) (and (forall ((v_ArrVal_106 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_106 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset) .cse0)))) is different from false [2022-12-12 13:05:19,162 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0))) (and (forall ((v_ArrVal_106 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_106 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset) .cse0)))) is different from false [2022-12-12 13:05:19,176 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (+ c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) is different from false [2022-12-12 13:05:19,221 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|)))) (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) (+ (select (select .cse1 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0))))) is different from false [2022-12-12 13:05:19,242 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0))))) is different from false [2022-12-12 13:05:19,254 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_106 (Array Int Int)) (v_ArrVal_105 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_105))) (<= (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_106) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-12-12 13:05:19,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:05:19,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2022-12-12 13:05:19,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2022-12-12 13:05:19,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2022-12-12 13:05:19,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 222 [2022-12-12 13:05:19,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:05:19,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2022-12-12 13:05:19,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:05:19,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-12-12 13:05:19,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-12-12 13:05:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-12 13:05:19,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756050820] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:05:19,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:05:19,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 45 [2022-12-12 13:05:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360853370] [2022-12-12 13:05:19,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:05:19,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-12 13:05:19,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:05:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-12 13:05:19,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1217, Unknown=8, NotChecked=616, Total=1980 [2022-12-12 13:05:19,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 109 [2022-12-12 13:05:19,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 633 flow. Second operand has 45 states, 45 states have (on average 38.06666666666667) internal successors, (1713), 45 states have internal predecessors, (1713), 0 states have call successors, (0), 0 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 13:05:19,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:05:19,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 109 [2022-12-12 13:05:19,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:05:22,588 INFO L130 PetriNetUnfolder]: 1002/2192 cut-off events. [2022-12-12 13:05:22,588 INFO L131 PetriNetUnfolder]: For 2160/2174 co-relation queries the response was YES. [2022-12-12 13:05:22,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7196 conditions, 2192 events. 1002/2192 cut-off events. For 2160/2174 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14590 event pairs, 50 based on Foata normal form. 4/2010 useless extension candidates. Maximal degree in co-relation 2505. Up to 581 conditions per place. [2022-12-12 13:05:22,602 INFO L137 encePairwiseOnDemand]: 83/109 looper letters, 278 selfloop transitions, 85 changer transitions 48/441 dead transitions. [2022-12-12 13:05:22,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 441 transitions, 3276 flow [2022-12-12 13:05:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-12 13:05:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-12 13:05:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 2463 transitions. [2022-12-12 13:05:22,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37660550458715597 [2022-12-12 13:05:22,608 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 73 predicate places. [2022-12-12 13:05:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 441 transitions, 3276 flow [2022-12-12 13:05:22,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 441 transitions, 2384 flow, removed 424 selfloop flow, removed 14 redundant places. [2022-12-12 13:05:22,619 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 441 transitions, 2384 flow [2022-12-12 13:05:22,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 38.06666666666667) internal successors, (1713), 45 states have internal predecessors, (1713), 0 states have call successors, (0), 0 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 13:05:22,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:05:22,620 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] [2022-12-12 13:05:22,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 13:05:22,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:05:22,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:05:22,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:05:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1120858113, now seen corresponding path program 2 times [2022-12-12 13:05:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:05:22,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802352908] [2022-12-12 13:05:22,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:05:22,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:05:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 13:05:22,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 13:05:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 13:05:22,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 13:05:22,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 13:05:22,886 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 13:05:22,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 13:05:22,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 13:05:22,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 13:05:22,888 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-12 13:05:22,891 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 13:05:22,891 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 13:05:22,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:05:22 BasicIcfg [2022-12-12 13:05:22,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 13:05:22,935 INFO L158 Benchmark]: Toolchain (without parser) took 9171.62ms. Allocated memory was 177.2MB in the beginning and 339.7MB in the end (delta: 162.5MB). Free memory was 136.8MB in the beginning and 121.4MB in the end (delta: 15.5MB). Peak memory consumption was 179.6MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,935 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 13:05:22,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.17ms. Allocated memory is still 177.2MB. Free memory was 136.8MB in the beginning and 123.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.10ms. Allocated memory is still 177.2MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,936 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 177.2MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,936 INFO L158 Benchmark]: RCFGBuilder took 509.87ms. Allocated memory is still 177.2MB. Free memory was 120.1MB in the beginning and 94.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,936 INFO L158 Benchmark]: TraceAbstraction took 8411.40ms. Allocated memory was 177.2MB in the beginning and 339.7MB in the end (delta: 162.5MB). Free memory was 93.9MB in the beginning and 121.4MB in the end (delta: -27.5MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. [2022-12-12 13:05:22,937 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.17ms. Allocated memory is still 177.2MB. Free memory was 136.8MB in the beginning and 123.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.10ms. Allocated memory is still 177.2MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 177.2MB. Free memory was 121.6MB in the beginning and 120.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 509.87ms. Allocated memory is still 177.2MB. Free memory was 120.1MB in the beginning and 94.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 8411.40ms. Allocated memory was 177.2MB in the beginning and 339.7MB in the end (delta: 162.5MB). Free memory was 93.9MB in the beginning and 121.4MB in the end (delta: -27.5MB). Peak memory consumption was 136.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={5:0}, t2={3:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, A={0:0}, counter=0, N=1, t1={5:0}, t2={3:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=1, A={0:0}, arr={-3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={-3:0}, N=1, size=1] [L97] 0 int i = 0; VAL [\old(size)=1, A={0:0}, arr={-3:0}, counter=0, i=0, N=1, size=1] [L97] COND TRUE 0 i < size VAL [\old(size)=1, A={0:0}, arr={-3:0}, counter=0, i=0, N=1, size=1] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=1, __VERIFIER_nondet_int()=6, A={0:0}, arr={-3:0}, counter=0, i=0, N=1, size=1] [L97] 0 i++ VAL [\old(size)=1, A={0:0}, arr={-3:0}, counter=0, i=1, N=1, size=1] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=1, A={0:0}, arr={-3:0}, counter=0, i=1, N=1, size=1] [L100] 0 return arr; VAL [\old(size)=1, \result={-3:0}, A={0:0}, arr={-3:0}, counter=0, i=1, N=1, size=1] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={-3:0}, counter=0, create_fresh_int_array(N)={-3:0}, N=1, t1={5:0}, t2={3:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, counter=0, N=1, pthread_create(&t1, 0, thread1, 0)=-2, t1={5:0}, t2={3:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, counter=0, N=1, pthread_create(&t2, 0, thread2, 0)=-1, t1={5:0}, t2={3:0}] [L83] 0 \read(t1) VAL [\read(t1)=-2, A={-3:0}, counter=0, N=1, t1={5:0}, t2={3:0}] [L49] 1 int i=0; VAL [A={-3:0}, counter=0, i=0, N=1] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={-3:0}, counter=0, i=0, N=1] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, counter=-6, i=0, N=1, tmp=-6] [L62] 2 i++ VAL [A={-3:0}, counter=-6, i=1, N=1, tmp=-6] [L62] COND FALSE 2 !(i