/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-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 18:20:22,098 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 18:20:22,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 18:20:22,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 18:20:22,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 18:20:22,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 18:20:22,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 18:20:22,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 18:20:22,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 18:20:22,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 18:20:22,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 18:20:22,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 18:20:22,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 18:20:22,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 18:20:22,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 18:20:22,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 18:20:22,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 18:20:22,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 18:20:22,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 18:20:22,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 18:20:22,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 18:20:22,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 18:20:22,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 18:20:22,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 18:20:22,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 18:20:22,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 18:20:22,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 18:20:22,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 18:20:22,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 18:20:22,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 18:20:22,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 18:20:22,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 18:20:22,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 18:20:22,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 18:20:22,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 18:20:22,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 18:20:22,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 18:20:22,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 18:20:22,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 18:20:22,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 18:20:22,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 18:20:22,196 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 18:20:22,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 18:20:22,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 18:20:22,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 18:20:22,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 18:20:22,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 18:20:22,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 18:20:22,237 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 18:20:22,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 18:20:22,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 18:20:22,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 18:20:22,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 18:20:22,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 18:20:22,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 18:20:22,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 18:20:22,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:20:22,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 18:20:22,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 18:20:22,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 18:20:22,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 18:20:22,241 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 18:20:22,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 18:20:22,241 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 18:20:22,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 18:20:22,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 18:20:22,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 18:20:22,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 18:20:22,606 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 18:20:22,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-06 18:20:23,928 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 18:20:24,186 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 18:20:24,187 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-06 18:20:24,194 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cde3b47a/a07d908ae5a5469391c5e043f81b7537/FLAG578a785d2 [2022-12-06 18:20:24,211 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cde3b47a/a07d908ae5a5469391c5e043f81b7537 [2022-12-06 18:20:24,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 18:20:24,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 18:20:24,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 18:20:24,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 18:20:24,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 18:20:24,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46eaff95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24, skipping insertion in model container [2022-12-06 18:20:24,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 18:20:24,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 18:20:24,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,392 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-send-receive.wvr.c[3107,3120] [2022-12-06 18:20:24,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:20:24,406 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 18:20:24,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 18:20:24,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 18:20:24,434 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-send-receive.wvr.c[3107,3120] [2022-12-06 18:20:24,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:20:24,457 INFO L208 MainTranslator]: Completed translation [2022-12-06 18:20:24,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24 WrapperNode [2022-12-06 18:20:24,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 18:20:24,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 18:20:24,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 18:20:24,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 18:20:24,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,512 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-12-06 18:20:24,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 18:20:24,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 18:20:24,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 18:20:24,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 18:20:24,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,556 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 18:20:24,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 18:20:24,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 18:20:24,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 18:20:24,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (1/1) ... [2022-12-06 18:20:24,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:20:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:20:24,592 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 18:20:24,621 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 18:20:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 18:20:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 18:20:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 18:20:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 18:20:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 18:20:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 18:20:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 18:20:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 18:20:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 18:20:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 18:20:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 18:20:24,648 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 18:20:24,787 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 18:20:24,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 18:20:25,083 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 18:20:25,188 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 18:20:25,189 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 18:20:25,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:25 BoogieIcfgContainer [2022-12-06 18:20:25,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 18:20:25,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 18:20:25,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 18:20:25,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 18:20:25,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:20:24" (1/3) ... [2022-12-06 18:20:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54737fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:25, skipping insertion in model container [2022-12-06 18:20:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:20:24" (2/3) ... [2022-12-06 18:20:25,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54737fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:20:25, skipping insertion in model container [2022-12-06 18:20:25,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:20:25" (3/3) ... [2022-12-06 18:20:25,198 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-12-06 18:20:25,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 18:20:25,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 18:20:25,212 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 18:20:25,265 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 18:20:25,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 132 transitions, 288 flow [2022-12-06 18:20:25,371 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-06 18:20:25,372 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 18:20:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 10/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-06 18:20:25,376 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 132 transitions, 288 flow [2022-12-06 18:20:25,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 256 flow [2022-12-06 18:20:25,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 18:20:25,401 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;@174f0220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 18:20:25,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 18:20:25,452 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-06 18:20:25,452 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 18:20:25,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:25,453 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] [2022-12-06 18:20:25,453 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 18:20:25,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1220330430, now seen corresponding path program 1 times [2022-12-06 18:20:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508773215] [2022-12-06 18:20:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:26,345 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 18:20:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:26,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508773215] [2022-12-06 18:20:26,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508773215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:20:26,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:20:26,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:20:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925074933] [2022-12-06 18:20:26,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:20:26,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:20:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:20:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:20:26,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2022-12-06 18:20:26,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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:20:26,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:26,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2022-12-06 18:20:26,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:20:26,716 INFO L130 PetriNetUnfolder]: 156/571 cut-off events. [2022-12-06 18:20:26,717 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-06 18:20:26,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 571 events. 156/571 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3005 event pairs, 23 based on Foata normal form. 56/561 useless extension candidates. Maximal degree in co-relation 777. Up to 79 conditions per place. [2022-12-06 18:20:26,728 INFO L137 encePairwiseOnDemand]: 119/132 looper letters, 41 selfloop transitions, 9 changer transitions 6/148 dead transitions. [2022-12-06 18:20:26,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 148 transitions, 449 flow [2022-12-06 18:20:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 18:20:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 18:20:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2022-12-06 18:20:26,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8731060606060606 [2022-12-06 18:20:26,753 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2022-12-06 18:20:26,754 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 449 flow [2022-12-06 18:20:26,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 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:20:26,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:26,766 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] [2022-12-06 18:20:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 18:20:26,767 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 18:20:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash 328701303, now seen corresponding path program 1 times [2022-12-06 18:20:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:26,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194815031] [2022-12-06 18:20:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:26,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194815031] [2022-12-06 18:20:26,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194815031] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:20:26,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064759189] [2022-12-06 18:20:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:26,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:20:26,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:20:26,927 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 18:20:26,947 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 18:20:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 18:20:27,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:20:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:27,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:20:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064759189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:20:27,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:20:27,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-06 18:20:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999185425] [2022-12-06 18:20:27,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:20:27,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 18:20:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 18:20:27,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 18:20:27,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2022-12-06 18:20:27,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 449 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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:20:27,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:27,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2022-12-06 18:20:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:20:27,466 INFO L130 PetriNetUnfolder]: 262/808 cut-off events. [2022-12-06 18:20:27,466 INFO L131 PetriNetUnfolder]: For 334/626 co-relation queries the response was YES. [2022-12-06 18:20:27,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 808 events. 262/808 cut-off events. For 334/626 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4808 event pairs, 29 based on Foata normal form. 33/752 useless extension candidates. Maximal degree in co-relation 1539. Up to 115 conditions per place. [2022-12-06 18:20:27,471 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 55 selfloop transitions, 8 changer transitions 59/218 dead transitions. [2022-12-06 18:20:27,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 218 transitions, 972 flow [2022-12-06 18:20:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 18:20:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 18:20:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2022-12-06 18:20:27,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8668831168831169 [2022-12-06 18:20:27,475 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-12-06 18:20:27,475 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 218 transitions, 972 flow [2022-12-06 18:20:27,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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:20:27,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:27,476 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] [2022-12-06 18:20:27,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 18:20:27,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:20:27,684 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 18:20:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1341262199, now seen corresponding path program 2 times [2022-12-06 18:20:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696154449] [2022-12-06 18:20:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:27,894 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 18:20:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:27,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696154449] [2022-12-06 18:20:27,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696154449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:20:27,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:20:27,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 18:20:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734399228] [2022-12-06 18:20:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:20:27,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 18:20:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 18:20:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 18:20:27,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-12-06 18:20:27,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 218 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:20:27,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:27,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-12-06 18:20:27,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:20:28,043 INFO L130 PetriNetUnfolder]: 310/944 cut-off events. [2022-12-06 18:20:28,043 INFO L131 PetriNetUnfolder]: For 1159/1487 co-relation queries the response was YES. [2022-12-06 18:20:28,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 944 events. 310/944 cut-off events. For 1159/1487 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5447 event pairs, 33 based on Foata normal form. 21/830 useless extension candidates. Maximal degree in co-relation 2098. Up to 253 conditions per place. [2022-12-06 18:20:28,047 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 39 selfloop transitions, 7 changer transitions 58/215 dead transitions. [2022-12-06 18:20:28,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 215 transitions, 1110 flow [2022-12-06 18:20:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 18:20:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 18:20:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-12-06 18:20:28,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2022-12-06 18:20:28,051 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2022-12-06 18:20:28,051 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 215 transitions, 1110 flow [2022-12-06 18:20:28,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:20:28,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:28,052 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] [2022-12-06 18:20:28,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 18:20:28,052 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 18:20:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -949834459, now seen corresponding path program 1 times [2022-12-06 18:20:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:28,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15347942] [2022-12-06 18:20:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:28,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:28,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15347942] [2022-12-06 18:20:28,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15347942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:20:28,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:20:28,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 18:20:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187307732] [2022-12-06 18:20:28,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:20:28,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 18:20:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 18:20:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 18:20:28,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 132 [2022-12-06 18:20:28,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 215 transitions, 1110 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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:20:28,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:28,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 132 [2022-12-06 18:20:28,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:20:28,559 INFO L130 PetriNetUnfolder]: 487/1313 cut-off events. [2022-12-06 18:20:28,560 INFO L131 PetriNetUnfolder]: For 3889/4480 co-relation queries the response was YES. [2022-12-06 18:20:28,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3941 conditions, 1313 events. 487/1313 cut-off events. For 3889/4480 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8294 event pairs, 112 based on Foata normal form. 17/1148 useless extension candidates. Maximal degree in co-relation 3293. Up to 536 conditions per place. [2022-12-06 18:20:28,565 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 57 selfloop transitions, 6 changer transitions 78/239 dead transitions. [2022-12-06 18:20:28,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 239 transitions, 1529 flow [2022-12-06 18:20:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 18:20:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 18:20:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 903 transitions. [2022-12-06 18:20:28,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.76010101010101 [2022-12-06 18:20:28,568 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2022-12-06 18:20:28,569 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 239 transitions, 1529 flow [2022-12-06 18:20:28,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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:20:28,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:28,569 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] [2022-12-06 18:20:28,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 18:20:28,570 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 18:20:28,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:28,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2006536016, now seen corresponding path program 1 times [2022-12-06 18:20:28,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:28,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771002220] [2022-12-06 18:20:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771002220] [2022-12-06 18:20:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771002220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:20:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480807122] [2022-12-06 18:20:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:20:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:20:29,585 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 18:20:29,588 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 18:20:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:29,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 18:20:29,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:20:29,734 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 18:20:29,775 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 18:20:29,776 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 18:20:29,817 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 18:20:29,818 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 18:20:30,218 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-12-06 18:20:30,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-12-06 18:20:30,390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:20:30,730 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 18:20:30,818 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:20:30,951 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 18:20:31,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 18:20:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:31,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:20:31,547 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1)))))))) is different from false [2022-12-06 18:20:31,687 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1)))))))) is different from false [2022-12-06 18:20:32,243 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse3 .cse2) 1)) (<= (+ c_~sum~0 (select .cse3 .cse1)) 1)))))) (< c_~front~0 0)) is different from false [2022-12-06 18:20:32,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:32,680 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 68 treesize of output 56 [2022-12-06 18:20:32,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:32,692 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 1308 treesize of output 1256 [2022-12-06 18:20:32,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:32,707 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 1244 treesize of output 1160 [2022-12-06 18:20:32,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:32,726 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 1148 treesize of output 968 [2022-12-06 18:20:32,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:32,743 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 956 treesize of output 920 [2022-12-06 18:20:33,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:33,311 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 68 treesize of output 56 [2022-12-06 18:20:33,326 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:20:33,327 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 644 treesize of output 616 [2022-12-06 18:20:33,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:20:33,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 437 [2022-12-06 18:20:33,354 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:20:33,355 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 588 treesize of output 544 [2022-12-06 18:20:33,371 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:20:33,371 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 540 treesize of output 448 [2022-12-06 18:20:33,447 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 18:20:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 18:20:36,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480807122] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:20:36,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:20:36,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 26] total 66 [2022-12-06 18:20:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464746052] [2022-12-06 18:20:36,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:20:36,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-06 18:20:36,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-06 18:20:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=3166, Unknown=55, NotChecked=372, Total=4290 [2022-12-06 18:20:36,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 132 [2022-12-06 18:20:36,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 239 transitions, 1529 flow. Second operand has 66 states, 66 states have (on average 54.39393939393939) internal successors, (3590), 66 states have internal predecessors, (3590), 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:20:36,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:36,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 132 [2022-12-06 18:20:36,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:20:36,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~front~0 4)) (.cse16 (* c_~back~0 4))) (let ((.cse7 (let ((.cse18 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse17 .cse18) 1)) (<= (+ (select .cse17 .cse19) c_~sum~0) 1)))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (<= 0 (+ (select .cse20 .cse19) c_~sum~0)))))))) (.cse4 (+ c_~queue~0.offset .cse16)) (.cse3 (+ c_~queue~0.offset .cse15)) (.cse10 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse15 .cse16))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3)) 1) (not (= (select .cse2 .cse4) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse5 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3)))))))) (or .cse0 (let ((.cse6 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse3)))) (and (<= .cse6 1) (<= 0 .cse6))) .cse1) (or .cse0 .cse1 .cse7) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse7) (or .cse0 (and (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse3))) (not (= (select .cse8 .cse4) 1))))) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse9 .cse4) 1)) (<= (+ c_~sum~0 (select .cse9 .cse3)) 1))))) .cse1) (or .cse10 .cse0 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| |c_#StackHeapBarrier|)))) (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse10 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse10 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse0 .cse1 (let ((.cse12 (+ .cse16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse13 (+ .cse15 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse11 .cse12) 1)) (<= 0 (+ (select .cse11 .cse13) c_~sum~0))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse14 .cse12) 1)) (<= (+ (select .cse14 .cse13) c_~sum~0) 1))))))) (= c_~sum~0 0)))) is different from false [2022-12-06 18:20:42,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~front~0 4)) (.cse16 (* c_~back~0 4))) (let ((.cse6 (let ((.cse18 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse17 .cse18) 1)) (<= (+ (select .cse17 .cse19) c_~sum~0) 1)))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (<= 0 (+ (select .cse20 .cse19) c_~sum~0)))))))) (.cse4 (+ c_~queue~0.offset .cse16)) (.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_6| |c_#StackHeapBarrier|))))) (.cse10 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse7 .cse16))) (.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (< c_~front~0 0)) (.cse3 (+ c_~queue~0.offset .cse7))) (and (<= 1 c_~sum~0) (or .cse0 .cse1 (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3)) 1) (not (= (select .cse2 .cse4) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse5 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3)))))))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (or .cse0 .cse1 .cse6) (<= c_~v_assert~0 1) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse6) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset .cse7 3)) (not (= .cse3 0)) (and (= (select (select |c_#memory_int| c_~queue~0.base) .cse3) 1) (= c_~sum~0 0))) (or .cse0 (and (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse3))) (not (= (select .cse8 .cse4) 1))))) (forall ((v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) c_~queue~0.base))) (or (not (= (select .cse9 .cse4) 1)) (<= (+ c_~sum~0 (select .cse9 .cse3)) 1))))) .cse1) (or .cse10 .cse0 .cse11 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse1) (or .cse10 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (= c_~queue~0.offset 0) (or .cse10 (< 0 c_~front~0) .cse11 .cse1) (<= 1 c_~v_assert~0) (or .cse10 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1) (or .cse0 .cse1 (let ((.cse13 (+ .cse16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse14 (+ .cse7 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse12 .cse13) 1)) (<= 0 (+ (select .cse12 .cse14) c_~sum~0))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse15 .cse13) 1)) (<= (+ (select .cse15 .cse14) c_~sum~0) 1))))))) (<= c_~sum~0 1) (or (<= .cse3 0) (<= c_~n~0 1))))) is different from false [2022-12-06 18:20:49,384 INFO L130 PetriNetUnfolder]: 11891/23215 cut-off events. [2022-12-06 18:20:49,384 INFO L131 PetriNetUnfolder]: For 43711/44612 co-relation queries the response was YES. [2022-12-06 18:20:49,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77769 conditions, 23215 events. 11891/23215 cut-off events. For 43711/44612 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 212829 event pairs, 1068 based on Foata normal form. 316/21359 useless extension candidates. Maximal degree in co-relation 55890. Up to 7802 conditions per place. [2022-12-06 18:20:49,538 INFO L137 encePairwiseOnDemand]: 96/132 looper letters, 576 selfloop transitions, 295 changer transitions 816/1734 dead transitions. [2022-12-06 18:20:49,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 1734 transitions, 15330 flow [2022-12-06 18:20:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-12-06 18:20:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-12-06 18:20:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 5860 transitions. [2022-12-06 18:20:49,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.457669478288035 [2022-12-06 18:20:49,553 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 118 predicate places. [2022-12-06 18:20:49,553 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 1734 transitions, 15330 flow [2022-12-06 18:20:49,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 54.39393939393939) internal successors, (3590), 66 states have internal predecessors, (3590), 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:20:49,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:20:49,555 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] [2022-12-06 18:20:49,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 18:20:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:20:49,788 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 18:20:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:20:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1160260242, now seen corresponding path program 2 times [2022-12-06 18:20:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:20:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719432332] [2022-12-06 18:20:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:20:49,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:20:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:20:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:20:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:20:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719432332] [2022-12-06 18:20:51,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719432332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:20:51,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121113518] [2022-12-06 18:20:51,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:20:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:20:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:20:51,692 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 18:20:51,694 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 18:20:51,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:20:51,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:20:51,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 18:20:51,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:20:52,311 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 15 treesize of output 11 [2022-12-06 18:20:52,689 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:20:52,777 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:20:52,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:20:52,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:20:53,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 18:20:53,132 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:20:53,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:20:53,426 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-12-06 18:20:54,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:54,865 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 65 treesize of output 53 [2022-12-06 18:20:54,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:54,873 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 232 treesize of output 228 [2022-12-06 18:20:54,878 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 152 treesize of output 128 [2022-12-06 18:20:54,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:54,887 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 131 treesize of output 131 [2022-12-06 18:20:54,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:54,898 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 180 treesize of output 168 [2022-12-06 18:20:55,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:20:55,132 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 65 treesize of output 53 [2022-12-06 18:20:55,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:20:55,143 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:20:55,143 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 148 treesize of output 136 [2022-12-06 18:20:55,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:20:55,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 89 [2022-12-06 18:20:55,155 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:20:55,155 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 120 treesize of output 100 [2022-12-06 18:20:55,852 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:20:55,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121113518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:20:55,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:20:55,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 25] total 71 [2022-12-06 18:20:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022168836] [2022-12-06 18:20:55,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:20:55,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-06 18:20:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:20:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-06 18:20:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=4407, Unknown=57, NotChecked=136, Total=4970 [2022-12-06 18:20:55,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 132 [2022-12-06 18:20:55,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 1734 transitions, 15330 flow. Second operand has 71 states, 71 states have (on average 48.521126760563384) internal successors, (3445), 71 states have internal predecessors, (3445), 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:20:55,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:20:55,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 132 [2022-12-06 18:20:55,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:21:22,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4)) (.cse18 (* c_~back~0 4))) (let ((.cse31 (<= c_~sum~0 0)) (.cse32 (<= 0 (+ c_~sum~0 1))) (.cse13 (= .cse19 .cse18)) (.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (+ c_~queue~0.offset .cse18)) (.cse5 (+ c_~queue~0.offset .cse19))) (let ((.cse1 (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)))))) (.cse11 (not (= (select .cse10 .cse4) 1))) (.cse12 (= .cse5 0)) (.cse8 (and .cse31 .cse32 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse13)) (.cse24 (and .cse31 .cse32 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse13)) (.cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse0 (<= c_~n~0 c_~front~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 .cse1 .cse2) (or (and (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse4) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)) 1))))) (forall ((v_ArrVal_146 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)))) (not (= (select (select .cse6 c_~queue~0.base) .cse4) 1)))))) .cse0 .cse2) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse7 .cse0 .cse8 .cse2) (or .cse0 (let ((.cse9 (+ c_~sum~0 (select .cse10 .cse5)))) (and (<= .cse9 1) (<= 0 .cse9))) .cse2) (or .cse0 .cse1 .cse2 .cse11) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (not .cse12) (and (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (or (= c_~sum~0 0) .cse11) .cse13 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (or .cse0 .cse8 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2) (or .cse0 (let ((.cse15 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse16 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse15)) 1)) (not (= (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse16) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse15)))) (not (= (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse16) 1))))))) .cse2) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and (or (<= .cse5 0) (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (= c_~queue~0.offset 0)) .cse12) (or .cse0 (let ((.cse21 (+ .cse19 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse22 (+ .cse18 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21)) 1)) (not (= (select (select .cse20 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21)))) (not (= (select (select .cse23 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22) 1))))))) .cse2) (<= 1 c_~v_assert~0) (or .cse24 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse2) (or (let ((.cse26 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (not (= (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse26) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27))))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (not (= (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse26) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse27)) 1))))))) .cse0 .cse2) (<= c_~sum~0 1) (or .cse0 (and (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)) 1)) (not (= (select (select .cse29 c_~queue~0.base) .cse4) 1))))) (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146))) (or (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse5)))) (not (= (select (select .cse30 c_~queue~0.base) .cse4) 1)))))) .cse2) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) .cse8 .cse2) (or .cse24 .cse7 .cse0 .cse2) (or .cse7 (and .cse31 .cse32 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse13) .cse0 .cse2))))) is different from false [2022-12-06 18:21:24,011 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-06 18:21:24,052 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-06 18:21:33,437 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (< c_~front~0 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-12-06 18:21:50,470 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-06 18:21:53,624 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-06 18:22:57,332 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 126 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:23:13,012 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:23:13,165 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-06 18:23:30,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:23:31,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:23:32,484 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-06 18:23:32,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:23:54,485 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 96 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:24:16,347 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:24:16,583 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:24:19,191 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 c_~v_assert~0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:25:28,586 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-06 18:25:41,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse7 (<= c_~sum~0 0)) (.cse8 (<= 0 (+ c_~sum~0 1))) (.cse9 (= .cse5 .cse6))) (let ((.cse2 (and .cse7 .cse8 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse9)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse1 (let ((.cse4 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_147 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_147 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_147) c_~queue~0.base) .cse4)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (< 0 c_~front~0) .cse2 .cse3) (or (and .cse7 .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse9) .cse0 .cse1 .cse3) (or .cse0 (and .cse7 .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse9) .cse1 .cse3))))) is different from false [2022-12-06 18:26:32,938 INFO L130 PetriNetUnfolder]: 163505/295339 cut-off events. [2022-12-06 18:26:32,938 INFO L131 PetriNetUnfolder]: For 619190/621640 co-relation queries the response was YES. [2022-12-06 18:26:33,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239782 conditions, 295339 events. 163505/295339 cut-off events. For 619190/621640 co-relation queries the response was YES. Maximal size of possible extension queue 10280. Compared 3329173 event pairs, 7950 based on Foata normal form. 1879/275485 useless extension candidates. Maximal degree in co-relation 1160133. Up to 101997 conditions per place. [2022-12-06 18:26:34,831 INFO L137 encePairwiseOnDemand]: 81/132 looper letters, 8452 selfloop transitions, 5150 changer transitions 20560/34200 dead transitions. [2022-12-06 18:26:34,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 34200 transitions, 366812 flow [2022-12-06 18:26:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 426 states. [2022-12-06 18:26:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2022-12-06 18:26:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 23777 transitions. [2022-12-06 18:26:34,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4228375302318964 [2022-12-06 18:26:34,882 INFO L294 CegarLoopForPetriNet]: 119 programPoint places, 543 predicate places. [2022-12-06 18:26:34,882 INFO L495 AbstractCegarLoop]: Abstraction has has 662 places, 34200 transitions, 366812 flow [2022-12-06 18:26:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 48.521126760563384) internal successors, (3445), 71 states have internal predecessors, (3445), 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:26:34,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:26:34,883 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] [2022-12-06 18:26:34,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 18:26:35,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:26:35,088 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 18:26:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:26:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1833530222, now seen corresponding path program 3 times [2022-12-06 18:26:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:26:35,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208268108] [2022-12-06 18:26:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:26:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:26:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:26:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:26:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:26:35,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208268108] [2022-12-06 18:26:35,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208268108] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:26:35,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404507054] [2022-12-06 18:26:35,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 18:26:35,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:26:35,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:26:35,643 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 18:26:35,672 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 18:26:35,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 18:26:35,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:26:35,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-06 18:26:35,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:26:35,827 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 18:26:35,871 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-06 18:26:35,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-06 18:26:36,187 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-06 18:26:36,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 18:26:36,410 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:26:36,729 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:26:36,812 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 18:26:37,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 18:26:37,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 18:26:37,133 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:26:37,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:26:37,245 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_186 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_186 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0))))))) is different from false [2022-12-06 18:26:37,356 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_186 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_186 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0))))))) is different from false [2022-12-06 18:26:37,786 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (forall ((v_ArrVal_186 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse1) c_~sum~0))) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_186 (Array Int Int))) (<= (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse1) c_~sum~0) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-06 18:26:37,844 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (forall ((v_ArrVal_186 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse1)))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse2) 1))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse2) 1)) (forall ((v_ArrVal_186 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse1)) 1))))))) (< c_~front~0 0)) is different from false [2022-12-06 18:26:37,861 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (forall ((v_ArrVal_186 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1)) 1)) (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) 1))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185))) (or (forall ((v_ArrVal_186 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1)))) (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-06 18:26:38,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:26:38,306 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 65 treesize of output 53 [2022-12-06 18:26:38,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:26:38,316 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 1504 treesize of output 1436 [2022-12-06 18:26:38,325 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 1286 treesize of output 1094 [2022-12-06 18:26:38,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:26:38,338 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 1232 treesize of output 1184 [2022-12-06 18:26:38,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:26:38,351 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 1172 treesize of output 1064 [2022-12-06 18:26:39,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:26:39,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2022-12-06 18:26:39,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:26:39,507 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:26:39,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2022-12-06 18:26:39,540 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:26:39,540 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 132 treesize of output 112 [2022-12-06 18:26:39,549 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 18:26:39,549 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 83 treesize of output 75 [2022-12-06 18:26:39,589 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 18:26:40,843 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 18:26:40,844 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 22 treesize of output 18 [2022-12-06 18:26:40,850 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 18:26:40,850 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 22 treesize of output 18 [2022-12-06 18:26:40,894 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:26:40,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404507054] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:26:40,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:26:40,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 26] total 60 [2022-12-06 18:26:40,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161850494] [2022-12-06 18:26:40,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:26:40,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-06 18:26:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:26:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-06 18:26:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=2560, Unknown=74, NotChecked=550, Total=3540 [2022-12-06 18:26:40,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 132 [2022-12-06 18:26:40,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 34200 transitions, 366812 flow. Second operand has 60 states, 60 states have (on average 52.81666666666667) internal successors, (3169), 60 states have internal predecessors, (3169), 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:26:40,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:26:40,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 132 [2022-12-06 18:26:40,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 18:31:52,820 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 18:31:52,828 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:31:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-06 18:31:52,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 18:31:52,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 18:31:53,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:31:53,164 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (60states, 50/132 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 257961 conditions, 53656 events (28730/53655 cut-off events. For 130153/133564 co-relation queries the response was YES. Maximal size of possible extension queue 11779. Compared 658966 event pairs, 1604 based on Foata normal form. 302/61080 useless extension candidates. Maximal degree in co-relation 225352. Up to 18472 conditions per place.). [2022-12-06 18:31:53,165 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 18:31:53,165 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 18:31:53,165 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 18:31:53,165 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2022-12-06 18:31:53,184 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 18:31:53,185 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 18:31:53,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:31:53 BasicIcfg [2022-12-06 18:31:53,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 18:31:53,191 INFO L158 Benchmark]: Toolchain (without parser) took 688976.69ms. Allocated memory was 186.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 163.1MB in the beginning and 453.3MB in the end (delta: -290.2MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 18:31:53,193 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 186.6MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 18:31:53,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 186.6MB. Free memory was 163.1MB in the beginning and 149.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 18:31:53,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.87ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 147.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:31:53,195 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 146.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 18:31:53,195 INFO L158 Benchmark]: RCFGBuilder took 631.10ms. Allocated memory is still 186.6MB. Free memory was 146.0MB in the beginning and 124.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 18:31:53,195 INFO L158 Benchmark]: TraceAbstraction took 687997.35ms. Allocated memory was 186.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 123.4MB in the beginning and 453.3MB in the end (delta: -329.9MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 18:31:53,196 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.24ms. Allocated memory is still 186.6MB. Free memory is still 163.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.25ms. Allocated memory is still 186.6MB. Free memory was 163.1MB in the beginning and 149.7MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.87ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 147.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.47ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 146.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 631.10ms. Allocated memory is still 186.6MB. Free memory was 146.0MB in the beginning and 124.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 687997.35ms. Allocated memory was 186.6MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 123.4MB in the beginning and 453.3MB in the end (delta: -329.9MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (60states, 50/132 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 257961 conditions, 53656 events (28730/53655 cut-off events. For 130153/133564 co-relation queries the response was YES. Maximal size of possible extension queue 11779. Compared 658966 event pairs, 1604 based on Foata normal form. 302/61080 useless extension candidates. Maximal degree in co-relation 225352. Up to 18472 conditions per place.). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (60states, 50/132 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 257961 conditions, 53656 events (28730/53655 cut-off events. For 130153/133564 co-relation queries the response was YES. Maximal size of possible extension queue 11779. Compared 658966 event pairs, 1604 based on Foata normal form. 302/61080 useless extension candidates. Maximal degree in co-relation 225352. Up to 18472 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (60states, 50/132 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 257961 conditions, 53656 events (28730/53655 cut-off events. For 130153/133564 co-relation queries the response was YES. Maximal size of possible extension queue 11779. Compared 658966 event pairs, 1604 based on Foata normal form. 302/61080 useless extension candidates. Maximal degree in co-relation 225352. Up to 18472 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (60states, 50/132 universal loopers) in iteration 7,while PetriNetUnfolder was constructing finite prefix that currently has 257961 conditions, 53656 events (28730/53655 cut-off events. For 130153/133564 co-relation queries the response was YES. Maximal size of possible extension queue 11779. Compared 658966 event pairs, 1604 based on Foata normal form. 302/61080 useless extension candidates. Maximal degree in co-relation 225352. Up to 18472 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 687.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 665.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 2368 mSolverCounterUnknown, 11366 SdHoareTripleChecker+Valid, 30.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11366 mSDsluCounter, 11361 SdHoareTripleChecker+Invalid, 27.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7003 IncrementalHoareTripleChecker+Unchecked, 11073 mSDsCounter, 895 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23954 IncrementalHoareTripleChecker+Invalid, 34220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 895 mSolverCounterUnsat, 288 mSDtfsCounter, 23954 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2368 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1578 GetRequests, 707 SyntacticMatches, 65 SemanticMatches, 806 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 114431 ImplicationChecksByTransitivity, 283.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366812occurred in iteration=6, InterpolantAutomatonStates: 550, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1510 ConstructedInterpolants, 149 QuantifiedInterpolants, 25515 SizeOfPredicates, 108 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 9/33 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