/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:54:50,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:54:50,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:54:50,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:54:50,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:54:50,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:54:50,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:54:50,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:54:50,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:54:50,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:54:50,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:54:50,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:54:50,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:54:50,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:54:50,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:54:50,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:54:50,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:54:50,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:54:50,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:54:50,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:54:50,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:54:50,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:54:50,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:54:50,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:54:50,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:54:50,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:54:50,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:54:50,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:54:50,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:54:50,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:54:50,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:54:50,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:54:50,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:54:50,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:54:50,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:54:50,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:54:50,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:54:50,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:54:50,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:54:50,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:54:50,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:54:50,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 17:54:50,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:54:50,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:54:50,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:54:50,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:54:50,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:54:50,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:54:50,184 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:54:50,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:54:50,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:54:50,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:54:50,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:54:50,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:54:50,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:54:50,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:54:50,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:54:50,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:54:50,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:54:50,187 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:54:50,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:54:50,187 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-06 17:54:50,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:54:50,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:54:50,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:54:50,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:54:50,431 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:54:50,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 17:54:51,414 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:54:51,601 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:54:51,602 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 17:54:51,607 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ef1ec59/7c0c23697a2f4f489e6dd20ef8f22ca6/FLAG79b64b85f [2022-12-06 17:54:51,627 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8ef1ec59/7c0c23697a2f4f489e6dd20ef8f22ca6 [2022-12-06 17:54:51,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:54:51,630 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:54:51,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:54:51,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:54:51,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:54:51,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ae848d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51, skipping insertion in model container [2022-12-06 17:54:51,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:54:51,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:54:51,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,824 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-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 17:54:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:54:51,845 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:54:51,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:54:51,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:54:51,875 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-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 17:54:51,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:54:51,896 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:54:51,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51 WrapperNode [2022-12-06 17:54:51,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:54:51,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:54:51,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:54:51,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:54:51,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,950 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-12-06 17:54:51,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:54:51,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:54:51,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:54:51,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:54:51,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,971 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:54:51,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:54:51,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:54:51,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:54:51,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (1/1) ... [2022-12-06 17:54:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:54:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:54:52,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 17:54:52,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 17:54:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:54:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:54:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:54:52,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:54:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:54:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:54:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 17:54:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:54:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:54:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:54:52,037 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:54:52,127 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:54:52,128 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:54:52,370 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:54:52,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:54:52,504 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 17:54:52,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:54:52 BoogieIcfgContainer [2022-12-06 17:54:52,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:54:52,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:54:52,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:54:52,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:54:52,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:54:51" (1/3) ... [2022-12-06 17:54:52,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5447cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:54:52, skipping insertion in model container [2022-12-06 17:54:52,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:54:51" (2/3) ... [2022-12-06 17:54:52,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5447cd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:54:52, skipping insertion in model container [2022-12-06 17:54:52,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:54:52" (3/3) ... [2022-12-06 17:54:52,513 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-12-06 17:54:52,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:54:52,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:54:52,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:54:52,586 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 17:54:52,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 17:54:52,687 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 17:54:52,688 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:54:52,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 17:54:52,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 17:54:52,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 17:54:52,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:54:52,714 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;@34749961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:54:52,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 17:54:52,753 INFO L130 PetriNetUnfolder]: 12/127 cut-off events. [2022-12-06 17:54:52,753 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:54:52,754 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:52,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:52,755 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-06 17:54:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1306986394, now seen corresponding path program 1 times [2022-12-06 17:54:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:52,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614581930] [2022-12-06 17:54:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:53,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614581930] [2022-12-06 17:54:53,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614581930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:54:53,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:54:53,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:54:53,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666990439] [2022-12-06 17:54:53,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:54:53,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:54:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:53,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:54:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:54:53,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-06 17:54:53,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:53,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:53,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-06 17:54:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:53,471 INFO L130 PetriNetUnfolder]: 54/337 cut-off events. [2022-12-06 17:54:53,471 INFO L131 PetriNetUnfolder]: For 71/72 co-relation queries the response was YES. [2022-12-06 17:54:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 337 events. 54/337 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1179 event pairs, 6 based on Foata normal form. 62/360 useless extension candidates. Maximal degree in co-relation 275. Up to 52 conditions per place. [2022-12-06 17:54:53,481 INFO L137 encePairwiseOnDemand]: 121/141 looper letters, 39 selfloop transitions, 6 changer transitions 10/144 dead transitions. [2022-12-06 17:54:53,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 443 flow [2022-12-06 17:54:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:54:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:54:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 981 transitions. [2022-12-06 17:54:53,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7730496453900709 [2022-12-06 17:54:53,501 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2022-12-06 17:54:53,501 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 144 transitions, 443 flow [2022-12-06 17:54:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:53,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:53,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:53,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:54:53,502 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-06 17:54:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1345092416, now seen corresponding path program 1 times [2022-12-06 17:54:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958824489] [2022-12-06 17:54:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958824489] [2022-12-06 17:54:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958824489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:54:53,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:54:53,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:54:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766949696] [2022-12-06 17:54:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:54:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:54:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:54:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:54:53,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-06 17:54:53,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 144 transitions, 443 flow. Second operand has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:53,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:53,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-06 17:54:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:53,994 INFO L130 PetriNetUnfolder]: 373/1219 cut-off events. [2022-12-06 17:54:53,994 INFO L131 PetriNetUnfolder]: For 599/664 co-relation queries the response was YES. [2022-12-06 17:54:53,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1219 events. 373/1219 cut-off events. For 599/664 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7686 event pairs, 127 based on Foata normal form. 0/1029 useless extension candidates. Maximal degree in co-relation 1186. Up to 422 conditions per place. [2022-12-06 17:54:54,004 INFO L137 encePairwiseOnDemand]: 132/141 looper letters, 69 selfloop transitions, 8 changer transitions 11/177 dead transitions. [2022-12-06 17:54:54,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 177 transitions, 750 flow [2022-12-06 17:54:54,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:54:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:54:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 864 transitions. [2022-12-06 17:54:54,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2022-12-06 17:54:54,007 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places. [2022-12-06 17:54:54,007 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 177 transitions, 750 flow [2022-12-06 17:54:54,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.42857142857143) internal successors, (731), 7 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:54,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:54,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:54,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:54:54,008 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-06 17:54:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1065748870, now seen corresponding path program 1 times [2022-12-06 17:54:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:54,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110335641] [2022-12-06 17:54:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:54,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110335641] [2022-12-06 17:54:54,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110335641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:54:54,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:54:54,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 17:54:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817773259] [2022-12-06 17:54:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:54:54,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 17:54:54,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:54,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 17:54:54,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-06 17:54:54,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 141 [2022-12-06 17:54:54,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 177 transitions, 750 flow. Second operand has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:54,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:54,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 141 [2022-12-06 17:54:54,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:54,766 INFO L130 PetriNetUnfolder]: 1193/2538 cut-off events. [2022-12-06 17:54:54,766 INFO L131 PetriNetUnfolder]: For 2035/2405 co-relation queries the response was YES. [2022-12-06 17:54:54,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6417 conditions, 2538 events. 1193/2538 cut-off events. For 2035/2405 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17223 event pairs, 784 based on Foata normal form. 0/2030 useless extension candidates. Maximal degree in co-relation 4235. Up to 1450 conditions per place. [2022-12-06 17:54:54,780 INFO L137 encePairwiseOnDemand]: 127/141 looper letters, 103 selfloop transitions, 13 changer transitions 17/201 dead transitions. [2022-12-06 17:54:54,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 201 transitions, 1114 flow [2022-12-06 17:54:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 17:54:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 17:54:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1116 transitions. [2022-12-06 17:54:54,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6088379705400983 [2022-12-06 17:54:54,783 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 27 predicate places. [2022-12-06 17:54:54,784 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 201 transitions, 1114 flow [2022-12-06 17:54:54,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:54,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:54,784 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:54,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:54:54,785 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-06 17:54:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1553962100, now seen corresponding path program 1 times [2022-12-06 17:54:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:54,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225638016] [2022-12-06 17:54:54,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:54,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:55,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:55,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225638016] [2022-12-06 17:54:55,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225638016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:54:55,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:54:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-06 17:54:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796894074] [2022-12-06 17:54:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:54:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 17:54:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 17:54:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-06 17:54:55,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 141 [2022-12-06 17:54:55,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 201 transitions, 1114 flow. Second operand has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:55,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:55,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 141 [2022-12-06 17:54:55,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:55,502 INFO L130 PetriNetUnfolder]: 1315/2560 cut-off events. [2022-12-06 17:54:55,503 INFO L131 PetriNetUnfolder]: For 3863/4867 co-relation queries the response was YES. [2022-12-06 17:54:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 2560 events. 1315/2560 cut-off events. For 3863/4867 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16371 event pairs, 817 based on Foata normal form. 0/2014 useless extension candidates. Maximal degree in co-relation 6037. Up to 1658 conditions per place. [2022-12-06 17:54:55,520 INFO L137 encePairwiseOnDemand]: 128/141 looper letters, 78 selfloop transitions, 7 changer transitions 49/202 dead transitions. [2022-12-06 17:54:55,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 202 transitions, 1399 flow [2022-12-06 17:54:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 17:54:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 17:54:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1049 transitions. [2022-12-06 17:54:55,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6199763593380615 [2022-12-06 17:54:55,524 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 38 predicate places. [2022-12-06 17:54:55,524 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 1399 flow [2022-12-06 17:54:55,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:55,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:55,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:55,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:54:55,525 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-06 17:54:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1590773823, now seen corresponding path program 1 times [2022-12-06 17:54:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:55,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203840444] [2022-12-06 17:54:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:55,678 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-06 17:54:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:55,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203840444] [2022-12-06 17:54:55,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203840444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:54:55,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945706797] [2022-12-06 17:54:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:54:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:54:55,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:54:55,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 17:54:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:55,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:54:55,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:54:55,995 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-06 17:54:55,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:54:56,144 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-06 17:54:56,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945706797] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:54:56,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:54:56,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-12-06 17:54:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058185766] [2022-12-06 17:54:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:54:56,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:54:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:54:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-06 17:54:56,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2022-12-06 17:54:56,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 1399 flow. Second operand has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:56,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:56,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2022-12-06 17:54:56,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:56,709 INFO L130 PetriNetUnfolder]: 1952/3806 cut-off events. [2022-12-06 17:54:56,710 INFO L131 PetriNetUnfolder]: For 7052/9811 co-relation queries the response was YES. [2022-12-06 17:54:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14956 conditions, 3806 events. 1952/3806 cut-off events. For 7052/9811 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26344 event pairs, 544 based on Foata normal form. 16/3126 useless extension candidates. Maximal degree in co-relation 13458. Up to 2504 conditions per place. [2022-12-06 17:54:56,739 INFO L137 encePairwiseOnDemand]: 130/141 looper letters, 165 selfloop transitions, 18 changer transitions 50/315 dead transitions. [2022-12-06 17:54:56,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 315 transitions, 2926 flow [2022-12-06 17:54:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 17:54:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 17:54:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1142 transitions. [2022-12-06 17:54:56,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7362991618310767 [2022-12-06 17:54:56,743 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 48 predicate places. [2022-12-06 17:54:56,743 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 315 transitions, 2926 flow [2022-12-06 17:54:56,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.33333333333333) internal successors, (876), 9 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:56,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:56,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:56,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 17:54:56,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:54:56,949 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-06 17:54:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1260998365, now seen corresponding path program 2 times [2022-12-06 17:54:56,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:56,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282318502] [2022-12-06 17:54:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:57,081 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-06 17:54:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282318502] [2022-12-06 17:54:57,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282318502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:54:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533579665] [2022-12-06 17:54:57,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:54:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:54:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:54:57,083 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-06 17:54:57,085 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-06 17:54:57,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:54:57,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:54:57,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 17:54:57,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:54:57,253 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-06 17:54:57,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:54:57,310 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-06 17:54:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533579665] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:54:57,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:54:57,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-12-06 17:54:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872151320] [2022-12-06 17:54:57,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:54:57,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 17:54:57,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:57,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 17:54:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 17:54:57,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 141 [2022-12-06 17:54:57,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 315 transitions, 2926 flow. Second operand has 16 states, 16 states have (on average 94.875) internal successors, (1518), 16 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:57,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:57,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 141 [2022-12-06 17:54:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:54:58,806 INFO L130 PetriNetUnfolder]: 3835/7407 cut-off events. [2022-12-06 17:54:58,807 INFO L131 PetriNetUnfolder]: For 12057/17210 co-relation queries the response was YES. [2022-12-06 17:54:58,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32945 conditions, 7407 events. 3835/7407 cut-off events. For 12057/17210 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 57754 event pairs, 210 based on Foata normal form. 163/6630 useless extension candidates. Maximal degree in co-relation 25876. Up to 4487 conditions per place. [2022-12-06 17:54:58,860 INFO L137 encePairwiseOnDemand]: 124/141 looper letters, 458 selfloop transitions, 127 changer transitions 59/723 dead transitions. [2022-12-06 17:54:58,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 723 transitions, 8258 flow [2022-12-06 17:54:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-06 17:54:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-06 17:54:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2783 transitions. [2022-12-06 17:54:58,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7310218019437877 [2022-12-06 17:54:58,865 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 74 predicate places. [2022-12-06 17:54:58,865 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 723 transitions, 8258 flow [2022-12-06 17:54:58,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 94.875) internal successors, (1518), 16 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:58,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:54:58,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:54:58,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 17:54:59,071 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,SelfDestructingSolverStorable5 [2022-12-06 17:54:59,072 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-06 17:54:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:54:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -632113741, now seen corresponding path program 3 times [2022-12-06 17:54:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:54:59,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630055451] [2022-12-06 17:54:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:54:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:54:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:54:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:59,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:54:59,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630055451] [2022-12-06 17:54:59,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630055451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:54:59,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005464442] [2022-12-06 17:54:59,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:54:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:54:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:54:59,188 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-06 17:54:59,190 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-06 17:54:59,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 17:54:59,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:54:59,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:54:59,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:54:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:59,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:54:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:54:59,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005464442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:54:59,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:54:59,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-12-06 17:54:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055654090] [2022-12-06 17:54:59,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:54:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 17:54:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:54:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 17:54:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-06 17:54:59,548 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2022-12-06 17:54:59,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 723 transitions, 8258 flow. Second operand has 19 states, 19 states have (on average 96.73684210526316) internal successors, (1838), 19 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:54:59,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:54:59,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2022-12-06 17:54:59,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:01,233 INFO L130 PetriNetUnfolder]: 5439/10028 cut-off events. [2022-12-06 17:55:01,233 INFO L131 PetriNetUnfolder]: For 17006/24247 co-relation queries the response was YES. [2022-12-06 17:55:01,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53119 conditions, 10028 events. 5439/10028 cut-off events. For 17006/24247 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 77850 event pairs, 207 based on Foata normal form. 171/8877 useless extension candidates. Maximal degree in co-relation 50541. Up to 6273 conditions per place. [2022-12-06 17:55:01,314 INFO L137 encePairwiseOnDemand]: 127/141 looper letters, 717 selfloop transitions, 113 changer transitions 60/1019 dead transitions. [2022-12-06 17:55:01,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1019 transitions, 13734 flow [2022-12-06 17:55:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:55:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:55:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1558 transitions. [2022-12-06 17:55:01,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7366430260047281 [2022-12-06 17:55:01,317 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 88 predicate places. [2022-12-06 17:55:01,318 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 1019 transitions, 13734 flow [2022-12-06 17:55:01,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 96.73684210526316) internal successors, (1838), 19 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:01,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:01,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:01,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 17:55:01,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:01,523 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-06 17:55:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1777441319, now seen corresponding path program 4 times [2022-12-06 17:55:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:01,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959477350] [2022-12-06 17:55:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:01,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959477350] [2022-12-06 17:55:01,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959477350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:01,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916984594] [2022-12-06 17:55:01,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:55:01,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:01,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:01,639 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-06 17:55:01,641 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-06 17:55:01,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:55:01,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:55:01,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:55:01,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:01,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:02,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916984594] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:55:02,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:55:02,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-12-06 17:55:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912862258] [2022-12-06 17:55:02,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:55:02,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:55:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:55:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:55:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:55:02,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2022-12-06 17:55:02,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1019 transitions, 13734 flow. Second operand has 20 states, 20 states have (on average 96.7) internal successors, (1934), 20 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:02,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:55:02,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2022-12-06 17:55:02,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:04,095 INFO L130 PetriNetUnfolder]: 6074/11444 cut-off events. [2022-12-06 17:55:04,096 INFO L131 PetriNetUnfolder]: For 24286/35681 co-relation queries the response was YES. [2022-12-06 17:55:04,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67383 conditions, 11444 events. 6074/11444 cut-off events. For 24286/35681 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 92578 event pairs, 161 based on Foata normal form. 191/10123 useless extension candidates. Maximal degree in co-relation 64166. Up to 6879 conditions per place. [2022-12-06 17:55:04,209 INFO L137 encePairwiseOnDemand]: 128/141 looper letters, 974 selfloop transitions, 133 changer transitions 56/1292 dead transitions. [2022-12-06 17:55:04,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1292 transitions, 20020 flow [2022-12-06 17:55:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 17:55:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 17:55:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1562 transitions. [2022-12-06 17:55:04,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7385342789598108 [2022-12-06 17:55:04,213 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 102 predicate places. [2022-12-06 17:55:04,213 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 1292 transitions, 20020 flow [2022-12-06 17:55:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.7) internal successors, (1934), 20 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:04,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:04,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:04,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 17:55:04,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:04,420 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-06 17:55:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1339433777, now seen corresponding path program 5 times [2022-12-06 17:55:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:04,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733187522] [2022-12-06 17:55:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:04,564 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-06 17:55:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733187522] [2022-12-06 17:55:04,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733187522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:04,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268818742] [2022-12-06 17:55:04,565 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 17:55:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:04,566 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-06 17:55:04,568 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-06 17:55:04,649 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:55:04,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:55:04,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 17:55:04,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:04,707 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-06 17:55:04,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:04,777 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-06 17:55:04,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268818742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:55:04,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:55:04,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-12-06 17:55:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718322545] [2022-12-06 17:55:04,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:55:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 17:55:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:55:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 17:55:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-06 17:55:04,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 141 [2022-12-06 17:55:04,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 1292 transitions, 20020 flow. Second operand has 15 states, 15 states have (on average 94.86666666666666) internal successors, (1423), 15 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:04,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:55:04,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 141 [2022-12-06 17:55:04,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:07,195 INFO L130 PetriNetUnfolder]: 6126/11568 cut-off events. [2022-12-06 17:55:07,195 INFO L131 PetriNetUnfolder]: For 27242/41874 co-relation queries the response was YES. [2022-12-06 17:55:07,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77457 conditions, 11568 events. 6126/11568 cut-off events. For 27242/41874 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 94193 event pairs, 117 based on Foata normal form. 166/10214 useless extension candidates. Maximal degree in co-relation 73918. Up to 6963 conditions per place. [2022-12-06 17:55:07,304 INFO L137 encePairwiseOnDemand]: 125/141 looper letters, 1035 selfloop transitions, 305 changer transitions 56/1475 dead transitions. [2022-12-06 17:55:07,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 1475 transitions, 24405 flow [2022-12-06 17:55:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 17:55:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 17:55:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2539 transitions. [2022-12-06 17:55:07,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7202836879432624 [2022-12-06 17:55:07,308 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 126 predicate places. [2022-12-06 17:55:07,309 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 1475 transitions, 24405 flow [2022-12-06 17:55:07,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 94.86666666666666) internal successors, (1423), 15 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:07,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:07,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:07,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 17:55:07,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:07,514 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-06 17:55:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 902828799, now seen corresponding path program 6 times [2022-12-06 17:55:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038444593] [2022-12-06 17:55:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:07,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:07,659 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-06 17:55:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038444593] [2022-12-06 17:55:07,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038444593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800475139] [2022-12-06 17:55:07,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 17:55:07,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:07,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:07,661 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-06 17:55:07,663 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-06 17:55:07,737 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 17:55:07,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:55:07,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 17:55:07,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:07,805 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-06 17:55:07,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:07,871 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-06 17:55:07,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800475139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:55:07,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:55:07,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-12-06 17:55:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110869662] [2022-12-06 17:55:07,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:55:07,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 17:55:07,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:55:07,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 17:55:07,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-06 17:55:07,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 141 [2022-12-06 17:55:07,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 1475 transitions, 24405 flow. Second operand has 17 states, 17 states have (on average 94.52941176470588) internal successors, (1607), 17 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:07,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:55:07,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 141 [2022-12-06 17:55:07,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:11,179 INFO L130 PetriNetUnfolder]: 7163/13435 cut-off events. [2022-12-06 17:55:11,179 INFO L131 PetriNetUnfolder]: For 38271/54320 co-relation queries the response was YES. [2022-12-06 17:55:11,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101095 conditions, 13435 events. 7163/13435 cut-off events. For 38271/54320 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 111263 event pairs, 141 based on Foata normal form. 249/11928 useless extension candidates. Maximal degree in co-relation 90476. Up to 8109 conditions per place. [2022-12-06 17:55:11,310 INFO L137 encePairwiseOnDemand]: 125/141 looper letters, 1190 selfloop transitions, 353 changer transitions 48/1670 dead transitions. [2022-12-06 17:55:11,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1670 transitions, 30733 flow [2022-12-06 17:55:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-06 17:55:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-06 17:55:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3599 transitions. [2022-12-06 17:55:11,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7292806484295846 [2022-12-06 17:55:11,314 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 160 predicate places. [2022-12-06 17:55:11,314 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1670 transitions, 30733 flow [2022-12-06 17:55:11,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 94.52941176470588) internal successors, (1607), 17 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:11,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:11,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:11,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 17:55:11,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:11,521 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-06 17:55:11,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:11,522 INFO L85 PathProgramCache]: Analyzing trace with hash 199442915, now seen corresponding path program 1 times [2022-12-06 17:55:11,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:11,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331497870] [2022-12-06 17:55:11,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:11,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:11,606 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-06 17:55:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331497870] [2022-12-06 17:55:11,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331497870] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:11,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837066647] [2022-12-06 17:55:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:11,608 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-06 17:55:11,610 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-06 17:55:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:11,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 17:55:11,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:11,738 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-06 17:55:11,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:11,823 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-06 17:55:11,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837066647] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:11,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:55:11,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-06 17:55:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100225270] [2022-12-06 17:55:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:55:11,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:55:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:55:11,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:55:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-06 17:55:11,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2022-12-06 17:55:11,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1670 transitions, 30733 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:11,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:55:11,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2022-12-06 17:55:11,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:13,973 INFO L130 PetriNetUnfolder]: 6054/11345 cut-off events. [2022-12-06 17:55:13,973 INFO L131 PetriNetUnfolder]: For 36155/40985 co-relation queries the response was YES. [2022-12-06 17:55:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89404 conditions, 11345 events. 6054/11345 cut-off events. For 36155/40985 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 89119 event pairs, 86 based on Foata normal form. 32/10084 useless extension candidates. Maximal degree in co-relation 77981. Up to 6612 conditions per place. [2022-12-06 17:55:14,072 INFO L137 encePairwiseOnDemand]: 133/141 looper letters, 1041 selfloop transitions, 202 changer transitions 47/1681 dead transitions. [2022-12-06 17:55:14,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1681 transitions, 33227 flow [2022-12-06 17:55:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:55:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:55:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2022-12-06 17:55:14,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.767983789260385 [2022-12-06 17:55:14,074 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 165 predicate places. [2022-12-06 17:55:14,074 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1681 transitions, 33227 flow [2022-12-06 17:55:14,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:14,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:14,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:14,081 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-06 17:55:14,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:14,280 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-06 17:55:14,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1159688625, now seen corresponding path program 1 times [2022-12-06 17:55:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:14,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577608172] [2022-12-06 17:55:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:55:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577608172] [2022-12-06 17:55:14,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577608172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:14,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368362972] [2022-12-06 17:55:14,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:14,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:14,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:15,000 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-06 17:55:15,002 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-06 17:55:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:15,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 17:55:15,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:15,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:55:15,166 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 17:55:15,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-06 17:55:15,209 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 17:55:15,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-06 17:55:15,599 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 17:55:15,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-12-06 17:55:15,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 17:55:15,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:55:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:55:16,116 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-06 17:55:16,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:55:16,167 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-06 17:55:16,225 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 15 treesize of output 7 [2022-12-06 17:55:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:16,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:16,341 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int))) (= c_~res1~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset) c_~res2~0))) is different from false [2022-12-06 17:55:16,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset)) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0))) is different from false [2022-12-06 17:55:16,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset))))) is different from false [2022-12-06 17:55:16,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) is different from false [2022-12-06 17:55:16,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_318))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-06 17:55:16,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:55:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2022-12-06 17:55:16,696 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 662 treesize of output 598 [2022-12-06 17:55:16,702 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 598 treesize of output 582 [2022-12-06 17:55:16,707 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 582 treesize of output 550 [2022-12-06 17:55:16,713 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 550 treesize of output 518 [2022-12-06 17:55:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 17:55:17,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368362972] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:55:17,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:55:17,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 50 [2022-12-06 17:55:17,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022495481] [2022-12-06 17:55:17,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:55:17,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-06 17:55:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:55:17,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-06 17:55:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1740, Unknown=28, NotChecked=450, Total=2450 [2022-12-06 17:55:17,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-06 17:55:17,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1681 transitions, 33227 flow. Second operand has 50 states, 50 states have (on average 56.18) internal successors, (2809), 50 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:17,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:55:17,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-06 17:55:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:55:23,399 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) c_~A~0.base) c_~A~0.offset)) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (= c_~res2~0 c_~res1~0)) is different from false [2022-12-06 17:55:28,910 INFO L130 PetriNetUnfolder]: 15730/27133 cut-off events. [2022-12-06 17:55:28,910 INFO L131 PetriNetUnfolder]: For 112884/120944 co-relation queries the response was YES. [2022-12-06 17:55:28,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220077 conditions, 27133 events. 15730/27133 cut-off events. For 112884/120944 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 228042 event pairs, 834 based on Foata normal form. 109/24124 useless extension candidates. Maximal degree in co-relation 196371. Up to 15214 conditions per place. [2022-12-06 17:55:29,149 INFO L137 encePairwiseOnDemand]: 106/141 looper letters, 1790 selfloop transitions, 495 changer transitions 73/2670 dead transitions. [2022-12-06 17:55:29,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 2670 transitions, 56309 flow [2022-12-06 17:55:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-06 17:55:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-06 17:55:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2546 transitions. [2022-12-06 17:55:29,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41992412996866235 [2022-12-06 17:55:29,157 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 207 predicate places. [2022-12-06 17:55:29,157 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 2670 transitions, 56309 flow [2022-12-06 17:55:29,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 56.18) internal successors, (2809), 50 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:55:29,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:55:29,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:55:29,163 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-06 17:55:29,362 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,SelfDestructingSolverStorable11 [2022-12-06 17:55:29,363 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-06 17:55:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:55:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1538502671, now seen corresponding path program 1 times [2022-12-06 17:55:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:55:29,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950248456] [2022-12-06 17:55:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:55:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:55:30,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950248456] [2022-12-06 17:55:30,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950248456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:55:30,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332366309] [2022-12-06 17:55:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:55:30,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:55:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:55:30,650 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-06 17:55:30,651 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-06 17:55:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:55:30,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-06 17:55:30,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:55:30,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:55:31,088 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 17:55:31,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-12-06 17:55:31,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 17:55:31,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:55:31,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:55:31,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-06 17:55:32,084 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 21 treesize of output 21 [2022-12-06 17:55:32,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:55:32,295 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 24 treesize of output 20 [2022-12-06 17:55:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:55:32,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:55:32,919 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 1)))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (<= c_~res1~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-12-06 17:55:33,310 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ .cse0 c_~res1~0 1)))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int))) (or (<= (+ .cse0 c_~res1~0) (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))))) is different from false [2022-12-06 17:55:33,422 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (< (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) 1))) (not (< ~M~0 c_~N~0)))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (<= (+ c_~res1~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))))) is different from false [2022-12-06 17:55:33,583 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (< (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) 1))))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (<= (+ c_~res1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (not (< ~M~0 c_~N~0))))) is different from false [2022-12-06 17:55:33,605 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (< (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) 1))))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (<= (+ c_~res1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (not (< ~M~0 c_~N~0))))) is different from false [2022-12-06 17:55:33,631 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (<= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_358 (Array Int Int)) (~M~0 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_356))) (< (+ c_~res2~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_358) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ c_~res1~0 1 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-12-06 17:55:34,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:55:34,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-12-06 17:55:34,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:55:34,126 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 3478 treesize of output 3104 [2022-12-06 17:55:34,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:55:34,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3094 treesize of output 2880 [2022-12-06 17:55:34,173 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 2870 treesize of output 2486 [2022-12-06 17:55:34,192 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 2486 treesize of output 2294 [2022-12-06 17:59:37,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:59:37,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2022-12-06 17:59:37,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 17:59:37,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 17:59:37,355 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 17:59:37,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 78 [2022-12-06 17:59:37,364 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 17:59:37,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 70 treesize of output 58 [2022-12-06 17:59:38,489 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 10 treesize of output 8 [2022-12-06 17:59:38,494 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 10 treesize of output 8 [2022-12-06 17:59:38,499 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 10 treesize of output 8 [2022-12-06 17:59:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:59:38,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332366309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:59:38,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:59:38,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 75 [2022-12-06 17:59:38,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049324199] [2022-12-06 17:59:38,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:59:38,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-06 17:59:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:59:38,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-06 17:59:38,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=4193, Unknown=21, NotChecked=834, Total=5550 [2022-12-06 17:59:38,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 141 [2022-12-06 17:59:38,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 2670 transitions, 56309 flow. Second operand has 75 states, 75 states have (on average 49.48) internal successors, (3711), 75 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:59:38,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:59:38,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 141 [2022-12-06 17:59:38,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:59:50,405 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 78 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:00:20,141 INFO L130 PetriNetUnfolder]: 27568/46252 cut-off events. [2022-12-06 18:00:20,142 INFO L131 PetriNetUnfolder]: For 273892/275806 co-relation queries the response was YES. [2022-12-06 18:00:20,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394310 conditions, 46252 events. 27568/46252 cut-off events. For 273892/275806 co-relation queries the response was YES. Maximal size of possible extension queue 2531. Compared 415104 event pairs, 1523 based on Foata normal form. 115/41232 useless extension candidates. Maximal degree in co-relation 312013. Up to 24937 conditions per place. [2022-12-06 18:00:20,677 INFO L137 encePairwiseOnDemand]: 101/141 looper letters, 3019 selfloop transitions, 1554 changer transitions 106/5294 dead transitions. [2022-12-06 18:00:20,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 5294 transitions, 122603 flow [2022-12-06 18:00:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-06 18:00:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-06 18:00:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 3091 transitions. [2022-12-06 18:00:20,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37796527268280755 [2022-12-06 18:00:20,682 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 264 predicate places. [2022-12-06 18:00:20,682 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 5294 transitions, 122603 flow [2022-12-06 18:00:20,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 49.48) internal successors, (3711), 75 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 18:00:20,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:00:20,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:00:20,693 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-06 18:00:20,890 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,SelfDestructingSolverStorable12 [2022-12-06 18:00:20,890 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-06 18:00:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:00:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 891037875, now seen corresponding path program 2 times [2022-12-06 18:00:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:00:20,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378819384] [2022-12-06 18:00:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:00:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:00:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:00:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:00:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:00:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378819384] [2022-12-06 18:00:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378819384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:00:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927788750] [2022-12-06 18:00:21,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:00:21,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:00:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:00:21,629 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-06 18:00:21,631 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-06 18:00:21,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:00:21,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:00:21,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 18:00:21,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:00:22,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:00:22,147 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-06 18:00:22,200 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 15 treesize of output 7 [2022-12-06 18:00:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:00:22,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:00:22,305 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int))) (= c_~res1~0 (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_391) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-12-06 18:00:22,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:00:22,324 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 46 treesize of output 36 [2022-12-06 18:00:22,328 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 13 treesize of output 11 [2022-12-06 18:00:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:00:22,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927788750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:00:22,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:00:22,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 36 [2022-12-06 18:00:22,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824181069] [2022-12-06 18:00:22,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:00:22,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-06 18:00:22,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:00:22,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-06 18:00:22,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1043, Unknown=1, NotChecked=66, Total=1260 [2022-12-06 18:00:22,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 141 [2022-12-06 18:00:22,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 5294 transitions, 122603 flow. Second operand has 36 states, 36 states have (on average 68.30555555555556) internal successors, (2459), 36 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 18:00:22,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:00:22,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 141 [2022-12-06 18:00:22,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:00:57,115 INFO L130 PetriNetUnfolder]: 32074/54135 cut-off events. [2022-12-06 18:00:57,115 INFO L131 PetriNetUnfolder]: For 369124/371774 co-relation queries the response was YES. [2022-12-06 18:00:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501850 conditions, 54135 events. 32074/54135 cut-off events. For 369124/371774 co-relation queries the response was YES. Maximal size of possible extension queue 2995. Compared 502515 event pairs, 846 based on Foata normal form. 185/48199 useless extension candidates. Maximal degree in co-relation 382091. Up to 29888 conditions per place. [2022-12-06 18:00:57,730 INFO L137 encePairwiseOnDemand]: 111/141 looper letters, 4679 selfloop transitions, 1121 changer transitions 134/6780 dead transitions. [2022-12-06 18:00:57,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 6780 transitions, 169259 flow [2022-12-06 18:00:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 18:00:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 18:00:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2239 transitions. [2022-12-06 18:00:57,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5122397620681767 [2022-12-06 18:00:57,732 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 294 predicate places. [2022-12-06 18:00:57,732 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 6780 transitions, 169259 flow [2022-12-06 18:00:57,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 68.30555555555556) internal successors, (2459), 36 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 18:00:57,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:00:57,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:00:57,740 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-06 18:00:57,938 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,SelfDestructingSolverStorable13 [2022-12-06 18:00:57,938 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-06 18:00:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:00:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash -611639833, now seen corresponding path program 3 times [2022-12-06 18:00:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:00:57,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726735648] [2022-12-06 18:00:57,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:00:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:00:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:00:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:00:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:00:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726735648] [2022-12-06 18:00:58,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726735648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:00:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613035517] [2022-12-06 18:00:58,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 18:00:58,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:00:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:00:58,700 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-06 18:00:58,703 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-06 18:00:58,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 18:00:58,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:00:58,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 18:00:58,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:00:59,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 18:00:59,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 18:00:59,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 18:00:59,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:00:59,554 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-06 18:00:59,579 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 15 treesize of output 7 [2022-12-06 18:00:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:00:59,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:00:59,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) c_~A~0.base) c_~A~0.offset)) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))))) is different from false [2022-12-06 18:00:59,868 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-12-06 18:00:59,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0)))) is different from false [2022-12-06 18:00:59,950 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-06 18:00:59,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:00:59,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2022-12-06 18:00:59,975 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 634 treesize of output 594 [2022-12-06 18:00:59,979 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 594 treesize of output 574 [2022-12-06 18:00:59,983 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 574 treesize of output 542 [2022-12-06 18:00:59,987 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 542 treesize of output 510 [2022-12-06 18:01:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 18:01:00,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613035517] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:01:00,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:01:00,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 19] total 46 [2022-12-06 18:01:00,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099149326] [2022-12-06 18:01:00,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:01:00,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-06 18:01:00,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:01:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-06 18:01:00,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1505, Unknown=42, NotChecked=332, Total=2070 [2022-12-06 18:01:00,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2022-12-06 18:01:00,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 6780 transitions, 169259 flow. Second operand has 46 states, 46 states have (on average 56.369565217391305) internal successors, (2593), 46 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 18:01:00,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:01:00,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2022-12-06 18:01:00,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:01:04,393 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (= c_~res2~0 c_~res1~0) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_428 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) c_~A~0.base) c_~A~0.offset)) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-12-06 18:01:04,621 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (= c_~res2~0 c_~res1~0) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_427))) (= (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_428) c_~A~0.base) c_~A~0.offset)))))) is different from false [2022-12-06 18:02:14,205 INFO L130 PetriNetUnfolder]: 40035/68207 cut-off events. [2022-12-06 18:02:14,205 INFO L131 PetriNetUnfolder]: For 562553/566106 co-relation queries the response was YES. [2022-12-06 18:02:14,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682342 conditions, 68207 events. 40035/68207 cut-off events. For 562553/566106 co-relation queries the response was YES. Maximal size of possible extension queue 3849. Compared 657579 event pairs, 1038 based on Foata normal form. 246/60506 useless extension candidates. Maximal degree in co-relation 502948. Up to 38730 conditions per place. [2022-12-06 18:02:15,041 INFO L137 encePairwiseOnDemand]: 102/141 looper letters, 6457 selfloop transitions, 1957 changer transitions 198/9443 dead transitions. [2022-12-06 18:02:15,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 9443 transitions, 253719 flow [2022-12-06 18:02:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 18:02:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 18:02:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2602 transitions. [2022-12-06 18:02:15,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41940683430045134 [2022-12-06 18:02:15,045 INFO L294 CegarLoopForPetriNet]: 126 programPoint places, 337 predicate places. [2022-12-06 18:02:15,045 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 9443 transitions, 253719 flow [2022-12-06 18:02:15,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 56.369565217391305) internal successors, (2593), 46 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 18:02:15,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:02:15,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 18:02:15,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 18:02:15,251 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,SelfDestructingSolverStorable14 [2022-12-06 18:02:15,252 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-06 18:02:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:02:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash -79951133, now seen corresponding path program 4 times [2022-12-06 18:02:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:02:15,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204420727] [2022-12-06 18:02:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:02:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:02:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:02:15,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:02:15,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:02:15,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204420727] [2022-12-06 18:02:15,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204420727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:02:15,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430456234] [2022-12-06 18:02:15,934 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 18:02:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:02:15,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:02:15,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 18:02:15,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 18:02:16,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 18:02:16,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:02:16,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-06 18:02:16,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:02:16,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 18:02:16,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 18:02:16,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:02:16,830 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-06 18:02:16,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:02:16,936 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-06 18:02:16,964 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 15 treesize of output 7 [2022-12-06 18:02:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:02:16,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:02:17,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_465) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-12-06 18:02:17,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_463))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_465) c_~A~0.base) c_~A~0.offset) c_~res2~0)))) is different from false [2022-12-06 18:02:17,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_463))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0)))) is different from false [2022-12-06 18:02:25,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_463))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-06 18:02:25,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:02:25,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2022-12-06 18:02:25,553 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 2678 treesize of output 2422 [2022-12-06 18:02:25,564 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 2422 treesize of output 2294 [2022-12-06 18:02:25,574 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 2294 treesize of output 2166 [2022-12-06 18:02:25,583 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 2166 treesize of output 2102 Received shutdown request... [2022-12-06 18:08:35,493 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 18:08:35,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 18:08:35,514 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-06 18:08:35,515 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 18:08:35,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 18:08:35,699 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 112 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 18:08:35,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 18:08:35,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 18:08:35,701 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 18:08:35,703 INFO L458 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1, 1, 1, 1, 1] [2022-12-06 18:08:35,707 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 18:08:35,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 18:08:35,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:08:35 BasicIcfg [2022-12-06 18:08:35,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 18:08:35,710 INFO L158 Benchmark]: Toolchain (without parser) took 824079.80ms. Allocated memory was 189.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 165.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-06 18:08:35,710 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 18:08:35,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.84ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 153.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 18:08:35,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.23ms. Allocated memory is still 189.8MB. Free memory was 153.8MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 18:08:35,711 INFO L158 Benchmark]: Boogie Preprocessor took 26.98ms. Allocated memory is still 189.8MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:08:35,711 INFO L158 Benchmark]: RCFGBuilder took 529.08ms. Allocated memory is still 189.8MB. Free memory was 149.6MB in the beginning and 117.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 18:08:35,711 INFO L158 Benchmark]: TraceAbstraction took 823200.31ms. Allocated memory was 189.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 117.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 18:08:35,712 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.09ms. Allocated memory is still 189.8MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.84ms. Allocated memory is still 189.8MB. Free memory was 165.9MB in the beginning and 153.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.23ms. Allocated memory is still 189.8MB. Free memory was 153.8MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.98ms. Allocated memory is still 189.8MB. Free memory was 151.2MB in the beginning and 149.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 529.08ms. Allocated memory is still 189.8MB. Free memory was 149.6MB in the beginning and 117.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 823200.31ms. Allocated memory was 189.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 117.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 112 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 112 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 112 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 112 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 823.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 178.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 44 mSolverCounterUnknown, 6648 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6648 mSDsluCounter, 5590 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2919 IncrementalHoareTripleChecker+Unchecked, 5049 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12857 IncrementalHoareTripleChecker+Invalid, 16026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 541 mSDtfsCounter, 12857 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2844 GetRequests, 2201 SyntacticMatches, 38 SemanticMatches, 605 ConstructedPredicates, 19 IntricatePredicates, 8 DeprecatedPredicates, 9500 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253719occurred in iteration=15, InterpolantAutomatonStates: 353, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 259.8s InterpolantComputationTime, 2763 NumberOfCodeBlocks, 2752 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3912 ConstructedInterpolants, 152 QuantifiedInterpolants, 27456 SizeOfPredicates, 188 NumberOfNonLiveVariables, 3175 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 30/81 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