/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 19:51:55,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 19:51:55,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 19:51:55,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 19:51:55,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 19:51:55,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 19:51:55,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 19:51:55,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 19:51:55,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 19:51:55,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 19:51:55,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 19:51:55,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 19:51:55,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 19:51:55,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 19:51:55,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 19:51:55,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 19:51:55,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 19:51:55,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 19:51:55,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 19:51:55,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 19:51:55,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 19:51:55,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 19:51:55,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 19:51:55,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 19:51:55,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 19:51:55,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 19:51:55,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 19:51:55,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 19:51:55,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 19:51:55,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 19:51:55,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 19:51:55,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 19:51:55,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 19:51:55,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 19:51:55,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 19:51:55,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 19:51:55,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 19:51:55,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 19:51:55,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 19:51:55,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 19:51:55,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 19:51:55,080 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-SemanticLbe.epf [2022-12-12 19:51:55,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 19:51:55,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 19:51:55,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 19:51:55,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 19:51:55,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 19:51:55,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 19:51:55,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 19:51:55,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 19:51:55,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:51:55,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 19:51:55,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 19:51:55,106 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 [2022-12-12 19:51:55,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 19:51:55,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 19:51:55,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 19:51:55,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 19:51:55,430 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 19:51:55,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-12-12 19:51:56,481 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 19:51:56,664 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 19:51:56,665 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product.wvr.c [2022-12-12 19:51:56,669 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367264c03/e0f12cb657bb4028af5d97d293b096fd/FLAGac58a56a8 [2022-12-12 19:51:56,679 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367264c03/e0f12cb657bb4028af5d97d293b096fd [2022-12-12 19:51:56,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 19:51:56,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 19:51:56,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 19:51:56,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 19:51:56,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 19:51:56,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5c496d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56, skipping insertion in model container [2022-12-12 19:51:56,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 19:51:56,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 19:51:56,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,825 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-dot-product.wvr.c[2865,2878] [2022-12-12 19:51:56,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:51:56,856 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 19:51:56,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 19:51:56,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 19:51:56,892 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-dot-product.wvr.c[2865,2878] [2022-12-12 19:51:56,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:51:56,905 INFO L208 MainTranslator]: Completed translation [2022-12-12 19:51:56,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56 WrapperNode [2022-12-12 19:51:56,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 19:51:56,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 19:51:56,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 19:51:56,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 19:51:56,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,961 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 22, statements flattened = 275 [2022-12-12 19:51:56,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 19:51:56,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 19:51:56,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 19:51:56,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 19:51:56,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,996 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:56,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 19:51:57,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 19:51:57,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 19:51:57,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 19:51:57,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (1/1) ... [2022-12-12 19:51:57,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:51:57,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:51:57,061 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 19:51:57,113 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 19:51:57,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 19:51:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 19:51:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 19:51:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 19:51:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 19:51:57,137 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 19:51:57,137 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 19:51:57,137 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 19:51:57,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 19:51:57,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 19:51:57,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 19:51:57,139 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 19:51:57,231 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 19:51:57,233 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 19:51:57,646 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 19:51:57,738 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 19:51:57,738 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-12 19:51:57,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:51:57 BoogieIcfgContainer [2022-12-12 19:51:57,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 19:51:57,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 19:51:57,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 19:51:57,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 19:51:57,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 07:51:56" (1/3) ... [2022-12-12 19:51:57,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65677954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:51:57, skipping insertion in model container [2022-12-12 19:51:57,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:51:56" (2/3) ... [2022-12-12 19:51:57,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65677954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:51:57, skipping insertion in model container [2022-12-12 19:51:57,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:51:57" (3/3) ... [2022-12-12 19:51:57,758 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2022-12-12 19:51:57,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 19:51:57,771 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 19:51:57,771 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 19:51:57,848 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 19:51:57,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 234 transitions, 492 flow [2022-12-12 19:51:57,959 INFO L130 PetriNetUnfolder]: 25/231 cut-off events. [2022-12-12 19:51:57,959 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:51:57,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 231 events. 25/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-12-12 19:51:57,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 234 transitions, 492 flow [2022-12-12 19:51:57,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 221 transitions, 460 flow [2022-12-12 19:51:57,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 19:51:57,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 221 transitions, 460 flow [2022-12-12 19:51:57,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 221 transitions, 460 flow [2022-12-12 19:51:58,047 INFO L130 PetriNetUnfolder]: 25/221 cut-off events. [2022-12-12 19:51:58,047 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:51:58,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 221 events. 25/221 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 296 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-12-12 19:51:58,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 221 transitions, 460 flow [2022-12-12 19:51:58,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 6720 [2022-12-12 19:52:04,354 INFO L241 LiptonReduction]: Total number of compositions: 188 [2022-12-12 19:52:04,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 19:52:04,381 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;@5586387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 19:52:04,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 19:52:04,389 INFO L130 PetriNetUnfolder]: 8/33 cut-off events. [2022-12-12 19:52:04,392 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 19:52:04,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:04,392 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] [2022-12-12 19:52:04,393 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 19:52:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 419614350, now seen corresponding path program 1 times [2022-12-12 19:52:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123209958] [2022-12-12 19:52:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:04,852 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 19:52:04,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:04,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123209958] [2022-12-12 19:52:04,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123209958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:04,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:52:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878967379] [2022-12-12 19:52:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:04,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:52:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:52:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:52:04,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-12 19:52:04,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 19:52:04,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:04,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-12 19:52:04,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:05,114 INFO L130 PetriNetUnfolder]: 961/1269 cut-off events. [2022-12-12 19:52:05,114 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-12 19:52:05,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 1269 events. 961/1269 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4445 event pairs, 307 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 2225. Up to 742 conditions per place. [2022-12-12 19:52:05,122 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-12 19:52:05,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 214 flow [2022-12-12 19:52:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:52:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:52:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-12 19:52:05,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2022-12-12 19:52:05,135 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-12 19:52:05,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 49 transitions, 214 flow [2022-12-12 19:52:05,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 49 transitions, 214 flow [2022-12-12 19:52:05,141 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 49 transitions, 214 flow [2022-12-12 19:52:05,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 19:52:05,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:05,141 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] [2022-12-12 19:52:05,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 19:52:05,141 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 19:52:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash -552178727, now seen corresponding path program 1 times [2022-12-12 19:52:05,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:05,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282006635] [2022-12-12 19:52:05,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:05,285 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 19:52:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:05,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282006635] [2022-12-12 19:52:05,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282006635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:05,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:05,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 19:52:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594790811] [2022-12-12 19:52:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:05,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 19:52:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 19:52:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 19:52:05,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-12 19:52:05,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 49 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 19:52:05,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:05,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-12 19:52:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:05,445 INFO L130 PetriNetUnfolder]: 962/1272 cut-off events. [2022-12-12 19:52:05,445 INFO L131 PetriNetUnfolder]: For 95/119 co-relation queries the response was YES. [2022-12-12 19:52:05,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3886 conditions, 1272 events. 962/1272 cut-off events. For 95/119 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4382 event pairs, 209 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 3309. Up to 1053 conditions per place. [2022-12-12 19:52:05,453 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 3 changer transitions 2/66 dead transitions. [2022-12-12 19:52:05,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 414 flow [2022-12-12 19:52:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:52:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:52:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-12 19:52:05,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2022-12-12 19:52:05,455 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-12 19:52:05,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 66 transitions, 414 flow [2022-12-12 19:52:05,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 64 transitions, 402 flow [2022-12-12 19:52:05,460 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 64 transitions, 402 flow [2022-12-12 19:52:05,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 19:52:05,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:05,460 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] [2022-12-12 19:52:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 19:52:05,460 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 19:52:05,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash 684951437, now seen corresponding path program 1 times [2022-12-12 19:52:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:05,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137785958] [2022-12-12 19:52:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:05,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:05,538 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 19:52:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137785958] [2022-12-12 19:52:05,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137785958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:05,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021583091] [2022-12-12 19:52:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:05,542 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 19:52:05,605 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 19:52:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:05,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 19:52:05,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:05,767 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 19:52:05,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:05,810 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 19:52:05,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021583091] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:05,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 19:52:05,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-12 19:52:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547536475] [2022-12-12 19:52:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:05,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 19:52:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 19:52:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-12 19:52:05,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-12 19:52:05,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 64 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 19:52:05,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:05,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-12 19:52:05,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:05,914 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][37], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 117#L49-5true, thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:05,915 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][38], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 117#L49-5true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 105#thread2EXITtrue, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:05,915 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:05,915 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:05,916 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:05,963 INFO L130 PetriNetUnfolder]: 1078/1436 cut-off events. [2022-12-12 19:52:05,964 INFO L131 PetriNetUnfolder]: For 534/560 co-relation queries the response was YES. [2022-12-12 19:52:05,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5692 conditions, 1436 events. 1078/1436 cut-off events. For 534/560 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5018 event pairs, 127 based on Foata normal form. 8/1059 useless extension candidates. Maximal degree in co-relation 4951. Up to 1164 conditions per place. [2022-12-12 19:52:05,973 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 79 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2022-12-12 19:52:05,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 746 flow [2022-12-12 19:52:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:52:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:52:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-12 19:52:05,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2022-12-12 19:52:05,976 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-12-12 19:52:05,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 91 transitions, 746 flow [2022-12-12 19:52:05,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 91 transitions, 746 flow [2022-12-12 19:52:05,983 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 91 transitions, 746 flow [2022-12-12 19:52:05,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 19:52:05,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:05,983 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] [2022-12-12 19:52:06,000 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 19:52:06,188 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 19:52:06,189 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 19:52:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1160832565, now seen corresponding path program 1 times [2022-12-12 19:52:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:06,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387257701] [2022-12-12 19:52:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387257701] [2022-12-12 19:52:06,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387257701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:06,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:06,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 19:52:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723051313] [2022-12-12 19:52:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:06,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:52:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:52:06,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 19:52:06,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-12 19:52:06,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 91 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:52:06,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:06,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-12 19:52:06,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:06,410 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][43], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 117#L49-5true, 184#L75-5true, thread1Thread1of1ForFork1InUse, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:06,410 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,411 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,411 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,411 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,411 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][44], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 117#L49-5true, 105#thread2EXITtrue, 226#true, 184#L75-5true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:06,411 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,413 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,413 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,416 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,552 INFO L130 PetriNetUnfolder]: 2098/2799 cut-off events. [2022-12-12 19:52:06,553 INFO L131 PetriNetUnfolder]: For 2211/2269 co-relation queries the response was YES. [2022-12-12 19:52:06,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 2799 events. 2098/2799 cut-off events. For 2211/2269 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11448 event pairs, 127 based on Foata normal form. 9/2053 useless extension candidates. Maximal degree in co-relation 11906. Up to 2258 conditions per place. [2022-12-12 19:52:06,575 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 151 selfloop transitions, 12 changer transitions 3/170 dead transitions. [2022-12-12 19:52:06,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 170 transitions, 1743 flow [2022-12-12 19:52:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:52:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:52:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-12 19:52:06,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-12 19:52:06,577 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-12-12 19:52:06,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 170 transitions, 1743 flow [2022-12-12 19:52:06,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 167 transitions, 1707 flow [2022-12-12 19:52:06,593 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 167 transitions, 1707 flow [2022-12-12 19:52:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:52:06,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:06,594 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] [2022-12-12 19:52:06,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 19:52:06,594 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 19:52:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -414638378, now seen corresponding path program 1 times [2022-12-12 19:52:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953069236] [2022-12-12 19:52:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:06,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:06,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953069236] [2022-12-12 19:52:06,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953069236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:06,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:06,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 19:52:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219948761] [2022-12-12 19:52:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:52:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:06,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:52:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:52:06,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:06,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 167 transitions, 1707 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 19:52:06,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:06,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:06,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:06,970 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][60], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 382#(= ~res2~0 ~res1~0), 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 117#L49-5true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:06,970 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,970 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,970 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][61], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 117#L49-5true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 105#thread2EXITtrue, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:06,971 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:06,971 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:07,032 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][102], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 382#(= ~res2~0 ~res1~0), thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 383#true, 117#L49-5true, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:07,033 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][103], [225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 382#(= ~res2~0 ~res1~0), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 383#true, 117#L49-5true, 184#L75-5true, thread1Thread1of1ForFork1InUse, 105#thread2EXITtrue, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:07,033 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:07,033 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:07,034 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:07,380 INFO L130 PetriNetUnfolder]: 4911/6599 cut-off events. [2022-12-12 19:52:07,381 INFO L131 PetriNetUnfolder]: For 9381/9451 co-relation queries the response was YES. [2022-12-12 19:52:07,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37633 conditions, 6599 events. 4911/6599 cut-off events. For 9381/9451 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 30708 event pairs, 506 based on Foata normal form. 49/5093 useless extension candidates. Maximal degree in co-relation 16972. Up to 5116 conditions per place. [2022-12-12 19:52:07,419 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 342 selfloop transitions, 15 changer transitions 6/365 dead transitions. [2022-12-12 19:52:07,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 365 transitions, 4468 flow [2022-12-12 19:52:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:52:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:52:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-12 19:52:07,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-12 19:52:07,423 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-12 19:52:07,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 365 transitions, 4468 flow [2022-12-12 19:52:07,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 359 transitions, 4387 flow [2022-12-12 19:52:07,529 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 359 transitions, 4387 flow [2022-12-12 19:52:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 19:52:07,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:07,529 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] [2022-12-12 19:52:07,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 19:52:07,529 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 19:52:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 622157725, now seen corresponding path program 1 times [2022-12-12 19:52:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161189407] [2022-12-12 19:52:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:52:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161189407] [2022-12-12 19:52:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161189407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:07,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:07,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 19:52:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200302705] [2022-12-12 19:52:07,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:07,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:52:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:52:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:52:07,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:07,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 359 transitions, 4387 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 19:52:07,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:07,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:07,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:08,005 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][103], [383#true, 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 226#true, 184#L75-5true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:08,005 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][104], [383#true, 117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:08,005 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:08,005 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:08,006 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:08,370 INFO L130 PetriNetUnfolder]: 5200/6999 cut-off events. [2022-12-12 19:52:08,370 INFO L131 PetriNetUnfolder]: For 8648/8799 co-relation queries the response was YES. [2022-12-12 19:52:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46348 conditions, 6999 events. 5200/6999 cut-off events. For 8648/8799 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 32511 event pairs, 526 based on Foata normal form. 15/5400 useless extension candidates. Maximal degree in co-relation 22085. Up to 5358 conditions per place. [2022-12-12 19:52:08,406 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 384 selfloop transitions, 30 changer transitions 6/423 dead transitions. [2022-12-12 19:52:08,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 423 transitions, 5983 flow [2022-12-12 19:52:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:52:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:52:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-12 19:52:08,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-12 19:52:08,408 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-12 19:52:08,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 423 transitions, 5983 flow [2022-12-12 19:52:08,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 417 transitions, 5899 flow [2022-12-12 19:52:08,438 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 417 transitions, 5899 flow [2022-12-12 19:52:08,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 19:52:08,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:08,439 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] [2022-12-12 19:52:08,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 19:52:08,439 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 19:52:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash 930931447, now seen corresponding path program 2 times [2022-12-12 19:52:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:08,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818309758] [2022-12-12 19:52:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:08,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:08,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:08,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818309758] [2022-12-12 19:52:08,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818309758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:08,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:08,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 19:52:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130046261] [2022-12-12 19:52:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:08,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 19:52:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 19:52:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-12 19:52:08,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:08,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 417 transitions, 5899 flow. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 19:52:08,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:08,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:08,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:08,951 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][69], [117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 400#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, 412#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L64-8true, thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:08,951 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:08,951 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:08,951 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:08,951 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:08,951 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][70], [117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 400#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L102-1true, 382#(= ~res2~0 ~res1~0), 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, 412#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread2Thread1of1ForFork2InUse, thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:08,952 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:08,952 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:08,952 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:08,952 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:09,489 INFO L130 PetriNetUnfolder]: 5452/7361 cut-off events. [2022-12-12 19:52:09,489 INFO L131 PetriNetUnfolder]: For 13520/13878 co-relation queries the response was YES. [2022-12-12 19:52:09,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55804 conditions, 7361 events. 5452/7361 cut-off events. For 13520/13878 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 34700 event pairs, 575 based on Foata normal form. 14/5757 useless extension candidates. Maximal degree in co-relation 27547. Up to 5644 conditions per place. [2022-12-12 19:52:09,530 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 431 selfloop transitions, 37 changer transitions 6/477 dead transitions. [2022-12-12 19:52:09,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 477 transitions, 7677 flow [2022-12-12 19:52:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:52:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:52:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-12-12 19:52:09,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-12 19:52:09,531 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-12 19:52:09,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 477 transitions, 7677 flow [2022-12-12 19:52:09,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 471 transitions, 7581 flow [2022-12-12 19:52:09,568 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 471 transitions, 7581 flow [2022-12-12 19:52:09,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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 19:52:09,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:09,569 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] [2022-12-12 19:52:09,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 19:52:09,569 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 19:52:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1573359735, now seen corresponding path program 3 times [2022-12-12 19:52:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:09,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402914745] [2022-12-12 19:52:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:09,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402914745] [2022-12-12 19:52:09,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402914745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:52:09,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:52:09,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 19:52:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664808747] [2022-12-12 19:52:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:52:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-12 19:52:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-12 19:52:09,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-12 19:52:09,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:09,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 471 transitions, 7581 flow. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 19:52:09,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:09,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:09,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:10,606 INFO L130 PetriNetUnfolder]: 4633/6335 cut-off events. [2022-12-12 19:52:10,606 INFO L131 PetriNetUnfolder]: For 15895/16111 co-relation queries the response was YES. [2022-12-12 19:52:10,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53846 conditions, 6335 events. 4633/6335 cut-off events. For 15895/16111 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 29420 event pairs, 479 based on Foata normal form. 4/5090 useless extension candidates. Maximal degree in co-relation 25794. Up to 4810 conditions per place. [2022-12-12 19:52:10,643 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 452 selfloop transitions, 44 changer transitions 8/507 dead transitions. [2022-12-12 19:52:10,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 507 transitions, 9149 flow [2022-12-12 19:52:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:52:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:52:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-12 19:52:10,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-12 19:52:10,646 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2022-12-12 19:52:10,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 507 transitions, 9149 flow [2022-12-12 19:52:10,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 499 transitions, 9005 flow [2022-12-12 19:52:10,744 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 499 transitions, 9005 flow [2022-12-12 19:52:10,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 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 19:52:10,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:10,745 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] [2022-12-12 19:52:10,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 19:52:10,745 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 19:52:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 652879711, now seen corresponding path program 1 times [2022-12-12 19:52:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:10,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217834166] [2022-12-12 19:52:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:10,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217834166] [2022-12-12 19:52:10,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217834166] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:10,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589776024] [2022-12-12 19:52:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:10,872 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 19:52:10,891 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 19:52:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:10,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-12 19:52:10,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:11,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:11,076 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 23 treesize of output 7 [2022-12-12 19:52:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589776024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:11,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-12 19:52:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317414831] [2022-12-12 19:52:11,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 19:52:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 19:52:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-12 19:52:11,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:11,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 499 transitions, 9005 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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 19:52:11,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:11,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:11,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:11,392 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][77], [425#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 400#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, 412#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L64-8true, 604#(and (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread2Thread1of1ForFork2InUse, 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:11,393 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:11,393 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:11,393 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:11,393 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:12,260 INFO L130 PetriNetUnfolder]: 6830/9290 cut-off events. [2022-12-12 19:52:12,260 INFO L131 PetriNetUnfolder]: For 26940/27602 co-relation queries the response was YES. [2022-12-12 19:52:12,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88011 conditions, 9290 events. 6830/9290 cut-off events. For 26940/27602 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 45256 event pairs, 735 based on Foata normal form. 16/7434 useless extension candidates. Maximal degree in co-relation 28734. Up to 7046 conditions per place. [2022-12-12 19:52:12,331 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 641 selfloop transitions, 47 changer transitions 6/697 dead transitions. [2022-12-12 19:52:12,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 697 transitions, 14006 flow [2022-12-12 19:52:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 19:52:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 19:52:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-12 19:52:12,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48161764705882354 [2022-12-12 19:52:12,333 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 37 predicate places. [2022-12-12 19:52:12,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 697 transitions, 14006 flow [2022-12-12 19:52:12,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 691 transitions, 13877 flow [2022-12-12 19:52:12,403 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 691 transitions, 13877 flow [2022-12-12 19:52:12,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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 19:52:12,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:12,404 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] [2022-12-12 19:52:12,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 19:52:12,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-12 19:52:12,610 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 19:52:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1609855286, now seen corresponding path program 1 times [2022-12-12 19:52:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:12,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572853751] [2022-12-12 19:52:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:52:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:12,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572853751] [2022-12-12 19:52:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572853751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:12,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129088230] [2022-12-12 19:52:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:12,763 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 19:52:12,783 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 19:52:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:12,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-12 19:52:12,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:52:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:12,998 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 23 treesize of output 7 [2022-12-12 19:52:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:52:13,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129088230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:13,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:13,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-12 19:52:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873385181] [2022-12-12 19:52:13,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:13,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 19:52:13,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:13,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 19:52:13,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-12 19:52:13,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:13,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 691 transitions, 13877 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 19:52:13,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:13,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:13,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:13,644 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][193], [428#true, 403#true, 383#true, 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 611#true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 415#true, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:13,645 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][194], [428#true, 403#true, 383#true, 117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 611#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 415#true, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:13,645 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:13,645 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:13,646 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:14,386 INFO L130 PetriNetUnfolder]: 7155/9722 cut-off events. [2022-12-12 19:52:14,386 INFO L131 PetriNetUnfolder]: For 34995/35932 co-relation queries the response was YES. [2022-12-12 19:52:14,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101465 conditions, 9722 events. 7155/9722 cut-off events. For 34995/35932 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 47846 event pairs, 726 based on Foata normal form. 17/7804 useless extension candidates. Maximal degree in co-relation 34354. Up to 7381 conditions per place. [2022-12-12 19:52:14,450 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 686 selfloop transitions, 59 changer transitions 6/755 dead transitions. [2022-12-12 19:52:14,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 755 transitions, 16645 flow [2022-12-12 19:52:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 19:52:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 19:52:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-12 19:52:14,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48161764705882354 [2022-12-12 19:52:14,452 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 44 predicate places. [2022-12-12 19:52:14,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 755 transitions, 16645 flow [2022-12-12 19:52:14,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 749 transitions, 16513 flow [2022-12-12 19:52:14,512 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 749 transitions, 16513 flow [2022-12-12 19:52:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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 19:52:14,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:14,512 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] [2022-12-12 19:52:14,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 19:52:14,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:14,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 19:52:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1939196018, now seen corresponding path program 2 times [2022-12-12 19:52:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:14,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563497402] [2022-12-12 19:52:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:14,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563497402] [2022-12-12 19:52:14,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563497402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393953204] [2022-12-12 19:52:14,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:52:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:14,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:52:15,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 19:52:15,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:52:15,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:52:15,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 19:52:15,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:52:15,203 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 18 treesize of output 20 [2022-12-12 19:52:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:15,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:15,284 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 41 treesize of output 25 [2022-12-12 19:52:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:15,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393953204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:15,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:15,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-12 19:52:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955260181] [2022-12-12 19:52:15,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:15,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-12 19:52:15,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-12 19:52:15,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-12-12 19:52:15,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:15,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 749 transitions, 16513 flow. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 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 19:52:15,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:15,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:15,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:15,948 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][126], [606#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 403#true, 117#L49-5true, 383#true, 991#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 794#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 15#L102-1true, 382#(= ~res2~0 ~res1~0), thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 415#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 226#true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:15,948 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][127], [606#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 403#true, 383#true, 117#L49-5true, 105#thread2EXITtrue, 991#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 794#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 415#true, 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:15,948 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:15,948 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:16,128 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][196], [428#true, 403#true, 383#true, 117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 611#true, thread3Thread1of1ForFork0InUse, 799#true, thread2Thread1of1ForFork2InUse, 415#true, thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:16,128 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][197], [428#true, 403#true, 383#true, 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 382#(= ~res2~0 ~res1~0), 611#true, thread3Thread1of1ForFork0InUse, 799#true, 135#L64-8true, thread2Thread1of1ForFork2InUse, 415#true, thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:16,129 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:16,129 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:16,849 INFO L130 PetriNetUnfolder]: 7442/10119 cut-off events. [2022-12-12 19:52:16,849 INFO L131 PetriNetUnfolder]: For 46923/48805 co-relation queries the response was YES. [2022-12-12 19:52:16,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115386 conditions, 10119 events. 7442/10119 cut-off events. For 46923/48805 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 50169 event pairs, 778 based on Foata normal form. 28/8200 useless extension candidates. Maximal degree in co-relation 41571. Up to 7698 conditions per place. [2022-12-12 19:52:16,919 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 727 selfloop transitions, 72 changer transitions 6/809 dead transitions. [2022-12-12 19:52:16,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 809 transitions, 19433 flow [2022-12-12 19:52:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 19:52:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 19:52:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-12 19:52:16,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.434640522875817 [2022-12-12 19:52:16,920 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 52 predicate places. [2022-12-12 19:52:16,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 809 transitions, 19433 flow [2022-12-12 19:52:16,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 803 transitions, 19289 flow [2022-12-12 19:52:16,985 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 803 transitions, 19289 flow [2022-12-12 19:52:16,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 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 19:52:16,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:16,985 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] [2022-12-12 19:52:16,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-12 19:52:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:17,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 19:52:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1252077892, now seen corresponding path program 3 times [2022-12-12 19:52:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:17,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022229009] [2022-12-12 19:52:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:17,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022229009] [2022-12-12 19:52:17,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022229009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:17,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433915450] [2022-12-12 19:52:17,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:52:17,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:17,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:17,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:52:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 19:52:17,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 19:52:17,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:52:17,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-12 19:52:17,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:17,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:52:17,670 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 18 treesize of output 20 [2022-12-12 19:52:17,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:52:17,701 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 18 treesize of output 20 [2022-12-12 19:52:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:17,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:17,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_423) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) (+ |c_thread1Thread1of1ForFork1_~j~0#1| 1))) is different from false [2022-12-12 19:52:17,781 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 157 treesize of output 133 [2022-12-12 19:52:17,790 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 130 treesize of output 106 [2022-12-12 19:52:17,794 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 106 treesize of output 94 [2022-12-12 19:52:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:52:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433915450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:17,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:17,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2022-12-12 19:52:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135513378] [2022-12-12 19:52:17,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:17,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-12 19:52:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-12 19:52:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=4, NotChecked=40, Total=506 [2022-12-12 19:52:17,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-12 19:52:17,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 803 transitions, 19289 flow. Second operand has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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 19:52:17,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:17,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-12 19:52:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:18,542 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][79], [425#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 989#(and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 117#L49-5true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 400#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 792#(and (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 390#(and (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 412#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~size~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread3Thread1of1ForFork0InUse, 135#L64-8true, 604#(and (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread2Thread1of1ForFork2InUse, 1190#(and (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~size~0 1) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0))]) [2022-12-12 19:52:18,542 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,542 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:18,542 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-12 19:52:18,542 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,678 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][124], [1192#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 606#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 403#true, 117#L49-5true, 383#true, 991#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 794#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 415#true, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:18,678 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:18,678 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:18,678 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:18,678 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:18,678 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][125], [1192#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 606#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 403#true, 117#L49-5true, 383#true, 105#thread2EXITtrue, 991#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 794#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~size~0 1) (<= ~size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 382#(= ~res2~0 ~res1~0), 15#L102-1true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 415#true, 184#L75-5true, 226#true, thread1Thread1of1ForFork1InUse, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:18,679 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-12 19:52:18,679 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-12 19:52:18,679 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:18,679 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-12 19:52:18,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1045] L62-5-->thread2EXIT: Formula: (and (not (< |v_thread2Thread1of1ForFork2_~i~1#1_In_3| v_~M~0_In_3)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_2| 0)) InVars {~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_2|, ~M~0=v_~M~0_In_3, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_3|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_#res#1.base][192], [428#true, 403#true, 996#true, 383#true, 117#L49-5true, 105#thread2EXITtrue, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 382#(= ~res2~0 ~res1~0), 15#L102-1true, 611#true, 799#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 415#true, 226#true, thread1Thread1of1ForFork1InUse, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:18,858 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1044] L62-5-->L64-8: Formula: (and (= |v_thread2Thread1of1ForFork2_~j~1#1_Out_2| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2| (ite (< (select (select |v_#memory_int_In_3| v_~A~0.base_In_3) (+ (* |v_thread2Thread1of1ForFork2_~i~1#1_In_1| 4) v_~A~0.offset_In_3)) v_~size~0_In_1) 1 0)) (< |v_thread2Thread1of1ForFork2_~i~1#1_In_1| v_~M~0_In_1) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|)) InVars {~A~0.base=v_~A~0.base_In_3, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|} OutVars{thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_2|, ~A~0.offset=v_~A~0.offset_In_3, ~size~0=v_~size~0_In_1, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_In_1|, ~M~0=v_~M~0_In_1, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork2_~j~1#1=|v_thread2Thread1of1ForFork2_~j~1#1_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem8#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_~j~1#1][193], [428#true, 403#true, 996#true, 117#L49-5true, 383#true, 225#(and (<= 0 ~M~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (not (<= ~N~0 ~M~0))), 15#L102-1true, 382#(= ~res2~0 ~res1~0), 611#true, 799#true, thread3Thread1of1ForFork0InUse, 135#L64-8true, thread2Thread1of1ForFork2InUse, 415#true, thread1Thread1of1ForFork1InUse, 226#true, 184#L75-5true, 379#(and (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (<= 1 ~N~0)), 393#true]) [2022-12-12 19:52:18,858 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-12 19:52:18,858 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-12 19:52:19,566 INFO L130 PetriNetUnfolder]: 6683/9153 cut-off events. [2022-12-12 19:52:19,566 INFO L131 PetriNetUnfolder]: For 58994/62058 co-relation queries the response was YES. [2022-12-12 19:52:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112953 conditions, 9153 events. 6683/9153 cut-off events. For 58994/62058 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 45031 event pairs, 742 based on Foata normal form. 38/7599 useless extension candidates. Maximal degree in co-relation 37081. Up to 6916 conditions per place. [2022-12-12 19:52:19,649 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 741 selfloop transitions, 86 changer transitions 8/839 dead transitions. [2022-12-12 19:52:19,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 839 transitions, 21807 flow [2022-12-12 19:52:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 19:52:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 19:52:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2022-12-12 19:52:19,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2022-12-12 19:52:19,650 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2022-12-12 19:52:19,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 839 transitions, 21807 flow [2022-12-12 19:52:19,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 831 transitions, 21599 flow [2022-12-12 19:52:19,727 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 831 transitions, 21599 flow [2022-12-12 19:52:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.260869565217392) internal successors, (98), 23 states have internal predecessors, (98), 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 19:52:19,727 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:19,728 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:52:19,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-12 19:52:19,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 19:52:19,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 19:52:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1307954742, now seen corresponding path program 2 times [2022-12-12 19:52:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488342192] [2022-12-12 19:52:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:20,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488342192] [2022-12-12 19:52:20,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488342192] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:20,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785263304] [2022-12-12 19:52:20,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:52:20,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:20,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:20,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:52:20,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 19:52:20,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 19:52:20,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:52:20,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-12 19:52:20,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:20,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:52:20,933 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 19:52:20,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 19:52:20,980 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 19:52:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:21,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:21,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_481) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 1)) is different from false [2022-12-12 19:52:21,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:52:21,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 146 [2022-12-12 19:52:21,211 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 130 treesize of output 118 [2022-12-12 19:52:21,214 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 118 treesize of output 94 [2022-12-12 19:52:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:21,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785263304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:21,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:21,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2022-12-12 19:52:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721726707] [2022-12-12 19:52:21,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:21,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-12 19:52:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-12 19:52:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1211, Unknown=8, NotChecked=70, Total=1406 [2022-12-12 19:52:21,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:52:21,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 831 transitions, 21599 flow. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 19:52:21,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:21,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:52:21,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:29,641 INFO L130 PetriNetUnfolder]: 26405/36216 cut-off events. [2022-12-12 19:52:29,641 INFO L131 PetriNetUnfolder]: For 263689/263689 co-relation queries the response was YES. [2022-12-12 19:52:29,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471541 conditions, 36216 events. 26405/36216 cut-off events. For 263689/263689 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 207054 event pairs, 768 based on Foata normal form. 194/30416 useless extension candidates. Maximal degree in co-relation 114401. Up to 27434 conditions per place. [2022-12-12 19:52:29,936 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 3792 selfloop transitions, 734 changer transitions 252/4778 dead transitions. [2022-12-12 19:52:29,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 4778 transitions, 132818 flow [2022-12-12 19:52:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-12 19:52:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-12 19:52:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 574 transitions. [2022-12-12 19:52:29,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43288084464555054 [2022-12-12 19:52:29,940 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 98 predicate places. [2022-12-12 19:52:29,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 4778 transitions, 132818 flow [2022-12-12 19:52:30,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 4526 transitions, 125698 flow [2022-12-12 19:52:30,229 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 4526 transitions, 125698 flow [2022-12-12 19:52:30,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 19:52:30,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:30,229 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:52:30,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 19:52:30,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:30,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 19:52:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 252886042, now seen corresponding path program 3 times [2022-12-12 19:52:30,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:30,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280251538] [2022-12-12 19:52:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:30,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280251538] [2022-12-12 19:52:30,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280251538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:30,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48259094] [2022-12-12 19:52:30,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:52:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:30,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:30,840 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:52:30,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 19:52:30,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 19:52:30,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:52:30,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 19:52:30,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:31,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:31,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:52:31,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-12 19:52:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:52:31,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48259094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:31,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:31,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-12-12 19:52:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294688313] [2022-12-12 19:52:31,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:31,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 19:52:31,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 19:52:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2022-12-12 19:52:31,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:52:31,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 4526 transitions, 125698 flow. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 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 19:52:31,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:31,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:52:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:52:52,181 INFO L130 PetriNetUnfolder]: 27040/37619 cut-off events. [2022-12-12 19:52:52,181 INFO L131 PetriNetUnfolder]: For 291139/291139 co-relation queries the response was YES. [2022-12-12 19:52:52,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527136 conditions, 37619 events. 27040/37619 cut-off events. For 291139/291139 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 223285 event pairs, 594 based on Foata normal form. 352/31551 useless extension candidates. Maximal degree in co-relation 185652. Up to 28627 conditions per place. [2022-12-12 19:52:52,492 INFO L137 encePairwiseOnDemand]: 15/34 looper letters, 4627 selfloop transitions, 1116 changer transitions 815/6558 dead transitions. [2022-12-12 19:52:52,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 6558 transitions, 195471 flow [2022-12-12 19:52:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-12 19:52:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-12-12 19:52:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 571 transitions. [2022-12-12 19:52:52,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29989495798319327 [2022-12-12 19:52:52,517 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 153 predicate places. [2022-12-12 19:52:52,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 6558 transitions, 195471 flow [2022-12-12 19:52:53,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 5743 transitions, 171166 flow [2022-12-12 19:52:53,048 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 5743 transitions, 171166 flow [2022-12-12 19:52:53,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 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 19:52:53,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:52:53,048 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:52:53,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 19:52:53,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:53,249 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 19:52:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:52:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -525175538, now seen corresponding path program 4 times [2022-12-12 19:52:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:52:53,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328687368] [2022-12-12 19:52:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:52:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:52:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:52:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:52:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:52:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328687368] [2022-12-12 19:52:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328687368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:52:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30068918] [2022-12-12 19:52:53,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 19:52:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:52:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:52:53,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:52:53,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 19:52:54,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 19:52:54,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:52:54,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-12 19:52:54,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:52:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:52:54,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:52:54,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:52:54,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-12 19:52:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:52:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30068918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:52:54,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:52:54,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 36 [2022-12-12 19:52:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75380807] [2022-12-12 19:52:54,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:52:54,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 19:52:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:52:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 19:52:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2022-12-12 19:52:54,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:52:54,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 5743 transitions, 171166 flow. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 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 19:52:54,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:52:54,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:52:54,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:53:21,722 INFO L130 PetriNetUnfolder]: 27685/37990 cut-off events. [2022-12-12 19:53:21,723 INFO L131 PetriNetUnfolder]: For 246089/246089 co-relation queries the response was YES. [2022-12-12 19:53:21,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574846 conditions, 37990 events. 27685/37990 cut-off events. For 246089/246089 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 218308 event pairs, 464 based on Foata normal form. 0/31179 useless extension candidates. Maximal degree in co-relation 214221. Up to 29316 conditions per place. [2022-12-12 19:53:22,063 INFO L137 encePairwiseOnDemand]: 17/34 looper letters, 6237 selfloop transitions, 3488 changer transitions 0/9725 dead transitions. [2022-12-12 19:53:22,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 9725 transitions, 308195 flow [2022-12-12 19:53:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-12 19:53:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-12 19:53:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 343 transitions. [2022-12-12 19:53:22,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2460545193687231 [2022-12-12 19:53:22,066 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 193 predicate places. [2022-12-12 19:53:22,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 9725 transitions, 308195 flow [2022-12-12 19:53:22,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 9725 transitions, 308195 flow [2022-12-12 19:53:22,465 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 9725 transitions, 308195 flow [2022-12-12 19:53:22,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 36 states have internal predecessors, (75), 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 19:53:22,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:53:22,465 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:53:22,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-12 19:53:22,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 19:53:22,670 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 19:53:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:53:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash -541168114, now seen corresponding path program 5 times [2022-12-12 19:53:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:53:22,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082995451] [2022-12-12 19:53:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:53:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:53:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:53:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:53:23,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:53:23,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082995451] [2022-12-12 19:53:23,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082995451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:53:23,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253962083] [2022-12-12 19:53:23,075 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 19:53:23,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:53:23,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:53:23,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:53:23,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 19:53:23,184 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 19:53:23,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:53:23,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-12 19:53:23,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:53:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:53:23,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:53:23,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:53:23,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-12 19:53:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:53:23,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253962083] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:53:23,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:53:23,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-12-12 19:53:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895659293] [2022-12-12 19:53:23,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:53:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-12 19:53:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:53:23,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-12 19:53:23,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-12-12 19:53:23,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:53:23,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 9725 transitions, 308195 flow. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 19:53:23,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:53:23,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:53:23,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:54:50,549 INFO L130 PetriNetUnfolder]: 45682/62141 cut-off events. [2022-12-12 19:54:50,549 INFO L131 PetriNetUnfolder]: For 351104/351104 co-relation queries the response was YES. [2022-12-12 19:54:50,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005863 conditions, 62141 events. 45682/62141 cut-off events. For 351104/351104 co-relation queries the response was YES. Maximal size of possible extension queue 2207. Compared 372200 event pairs, 770 based on Foata normal form. 0/51891 useless extension candidates. Maximal degree in co-relation 412855. Up to 48759 conditions per place. [2022-12-12 19:54:51,151 INFO L137 encePairwiseOnDemand]: 13/34 looper letters, 10134 selfloop transitions, 6346 changer transitions 0/16480 dead transitions. [2022-12-12 19:54:51,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 16480 transitions, 553930 flow [2022-12-12 19:54:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-12-12 19:54:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-12-12 19:54:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 833 transitions. [2022-12-12 19:54:51,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26344086021505375 [2022-12-12 19:54:51,155 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 285 predicate places. [2022-12-12 19:54:51,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 16480 transitions, 553930 flow [2022-12-12 19:54:51,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 16480 transitions, 553930 flow [2022-12-12 19:54:51,870 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 16480 transitions, 553930 flow [2022-12-12 19:54:51,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 19:54:51,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:54:51,870 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:54:51,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 19:54:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-12 19:54:52,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 19:54:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:54:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -470862014, now seen corresponding path program 6 times [2022-12-12 19:54:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:54:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124827711] [2022-12-12 19:54:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:54:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:54:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:54:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:54:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:54:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124827711] [2022-12-12 19:54:52,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124827711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:54:52,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547020956] [2022-12-12 19:54:52,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 19:54:52,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:54:52,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:54:52,513 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:54:52,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 19:54:52,640 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 19:54:52,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:54:52,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-12 19:54:52,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:54:52,813 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-12-12 19:54:52,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2022-12-12 19:54:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:54:52,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:54:53,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:54:53,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-12 19:54:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:54:53,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547020956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:54:53,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:54:53,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 29 [2022-12-12 19:54:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83758539] [2022-12-12 19:54:53,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:54:53,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 19:54:53,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:54:53,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 19:54:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2022-12-12 19:54:53,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:54:53,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 16480 transitions, 553930 flow. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 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 19:54:53,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:54:53,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:54:53,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:59:54,593 INFO L130 PetriNetUnfolder]: 77027/103920 cut-off events. [2022-12-12 19:59:54,593 INFO L131 PetriNetUnfolder]: For 431040/431040 co-relation queries the response was YES. [2022-12-12 19:59:54,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1796712 conditions, 103920 events. 77027/103920 cut-off events. For 431040/431040 co-relation queries the response was YES. Maximal size of possible extension queue 3322. Compared 641880 event pairs, 859 based on Foata normal form. 0/84509 useless extension candidates. Maximal degree in co-relation 920153. Up to 88196 conditions per place. [2022-12-12 19:59:55,693 INFO L137 encePairwiseOnDemand]: 15/34 looper letters, 19491 selfloop transitions, 12106 changer transitions 0/31597 dead transitions. [2022-12-12 19:59:55,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 31597 transitions, 1118451 flow [2022-12-12 19:59:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-12 19:59:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-12-12 19:59:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 861 transitions. [2022-12-12 19:59:55,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246606334841629 [2022-12-12 19:59:55,703 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 362 predicate places. [2022-12-12 19:59:55,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 398 places, 31597 transitions, 1118451 flow [2022-12-12 19:59:57,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 398 places, 31597 transitions, 1118451 flow [2022-12-12 19:59:57,116 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 31597 transitions, 1118451 flow [2022-12-12 19:59:57,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 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 19:59:57,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:59:57,116 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:59:57,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 19:59:57,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 19:59:57,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 19:59:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:59:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1850934952, now seen corresponding path program 7 times [2022-12-12 19:59:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:59:57,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569785543] [2022-12-12 19:59:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:59:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:59:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:59:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:59:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:59:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569785543] [2022-12-12 19:59:57,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569785543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:59:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261262656] [2022-12-12 19:59:57,690 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 19:59:57,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:59:57,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:59:57,691 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:59:57,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 19:59:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:59:57,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-12 19:59:57,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:59:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:59:58,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:59:58,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 19:59:58,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-12-12 19:59:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:59:58,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261262656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:59:58,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:59:58,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-12-12 19:59:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813754209] [2022-12-12 19:59:58,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:59:58,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 19:59:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:59:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 19:59:58,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2022-12-12 19:59:58,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-12 19:59:58,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 31597 transitions, 1118451 flow. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 31 states have internal predecessors, (73), 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 19:59:58,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:59:58,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-12 19:59:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 20:06:01,397 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 20:06:01,409 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 20:06:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-12 20:06:01,479 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-12 20:06:01,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-12 20:06:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-12 20:06:01,685 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (32states, 0/34 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 964530 conditions, 53223 events (39100/53222 cut-off events. For 328363/328363 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 347732 event pairs, 455 based on Foata normal form. 0/47479 useless extension candidates. Maximal degree in co-relation 319934. Up to 44712 conditions per place.). [2022-12-12 20:06:01,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-12 20:06:01,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-12 20:06:01,687 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-12 20:06:01,688 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 3, 1, 1, 1, 1, 1] [2022-12-12 20:06:01,694 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 20:06:01,694 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 20:06:01,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 08:06:01 BasicIcfg [2022-12-12 20:06:01,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 20:06:01,698 INFO L158 Benchmark]: Toolchain (without parser) took 845016.53ms. Allocated memory was 209.7MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 185.5MB in the beginning and 808.4MB in the end (delta: -622.9MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 20:06:01,698 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 186.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 20:06:01,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.03ms. Allocated memory is still 209.7MB. Free memory was 184.9MB in the beginning and 171.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 20:06:01,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.93ms. Allocated memory is still 209.7MB. Free memory was 171.8MB in the beginning and 169.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 20:06:01,704 INFO L158 Benchmark]: Boogie Preprocessor took 36.44ms. Allocated memory is still 209.7MB. Free memory was 169.2MB in the beginning and 167.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 20:06:01,704 INFO L158 Benchmark]: RCFGBuilder took 751.96ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 130.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 20:06:01,704 INFO L158 Benchmark]: TraceAbstraction took 843943.96ms. Allocated memory was 209.7MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 129.9MB in the beginning and 808.4MB in the end (delta: -678.5MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 20:06:01,707 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.13ms. Allocated memory is still 209.7MB. Free memory is still 186.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.03ms. Allocated memory is still 209.7MB. Free memory was 184.9MB in the beginning and 171.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.93ms. Allocated memory is still 209.7MB. Free memory was 171.8MB in the beginning and 169.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.44ms. Allocated memory is still 209.7MB. Free memory was 169.2MB in the beginning and 167.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 751.96ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 130.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 843943.96ms. Allocated memory was 209.7MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 129.9MB in the beginning and 808.4MB in the end (delta: -678.5MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 206 PlacesBefore, 36 PlacesAfterwards, 221 TransitionsBefore, 34 TransitionsAfterwards, 6720 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 100 TrivialYvCompositions, 70 ConcurrentYvCompositions, 17 ChoiceCompositions, 188 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 4719, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4753, independent: 4719, independent conditional: 0, independent unconditional: 4719, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4299, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4299, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4753, independent: 446, independent conditional: 0, independent unconditional: 446, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 4299, unknown conditional: 0, unknown unconditional: 4299] , Statistics on independence cache: Total cache size (in pairs): 7846, Positive cache size: 7820, Positive conditional cache size: 0, Positive unconditional cache size: 7820, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (32states, 0/34 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 964530 conditions, 53223 events (39100/53222 cut-off events. For 328363/328363 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 347732 event pairs, 455 based on Foata normal form. 0/47479 useless extension candidates. Maximal degree in co-relation 319934. Up to 44712 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (32states, 0/34 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 964530 conditions, 53223 events (39100/53222 cut-off events. For 328363/328363 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 347732 event pairs, 455 based on Foata normal form. 0/47479 useless extension candidates. Maximal degree in co-relation 319934. Up to 44712 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (32states, 0/34 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 964530 conditions, 53223 events (39100/53222 cut-off events. For 328363/328363 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 347732 event pairs, 455 based on Foata normal form. 0/47479 useless extension candidates. Maximal degree in co-relation 319934. Up to 44712 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (32states, 0/34 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 964530 conditions, 53223 events (39100/53222 cut-off events. For 328363/328363 co-relation queries the response was YES. Maximal size of possible extension queue 3792. Compared 347732 event pairs, 455 based on Foata normal form. 0/47479 useless extension candidates. Maximal degree in co-relation 319934. Up to 44712 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 285 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 3.9s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 843.8s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 820.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5166 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5166 mSDsluCounter, 1316 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 404 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25502 IncrementalHoareTripleChecker+Invalid, 26163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 117 mSDtfsCounter, 25502 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 483 SyntacticMatches, 11 SemanticMatches, 671 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14339 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1118451occurred in iteration=17, InterpolantAutomatonStates: 380, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 32491 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1080 ConstructedInterpolants, 16 QuantifiedInterpolants, 8250 SizeOfPredicates, 152 NumberOfNonLiveVariables, 3286 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 154/212 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown