/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 11:40:58,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 11:40:58,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 11:40:58,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 11:40:58,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 11:40:58,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 11:40:58,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 11:40:58,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 11:40:58,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 11:40:58,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 11:40:58,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 11:40:58,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 11:40:58,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 11:40:58,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 11:40:58,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 11:40:58,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 11:40:58,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 11:40:58,374 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 11:40:58,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 11:40:58,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 11:40:58,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 11:40:58,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 11:40:58,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 11:40:58,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 11:40:58,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 11:40:58,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 11:40:58,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 11:40:58,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 11:40:58,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 11:40:58,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 11:40:58,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 11:40:58,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 11:40:58,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 11:40:58,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 11:40:58,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 11:40:58,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 11:40:58,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 11:40:58,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 11:40:58,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 11:40:58,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 11:40:58,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 11:40:58,394 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-VariableLbe.epf [2023-01-28 11:40:58,413 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 11:40:58,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 11:40:58,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 11:40:58,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 11:40:58,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 11:40:58,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 11:40:58,415 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 11:40:58,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 11:40:58,415 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 11:40:58,416 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 11:40:58,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:40:58,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 11:40:58,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 11:40:58,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 11:40:58,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 11:40:58,418 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 11:40:58,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 11:40:58,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 11:40:58,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 11:40:58,610 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 11:40:58,610 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 11:40:58,611 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 [2023-01-28 11:40:59,491 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 11:40:59,677 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 11:40:59,677 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-28 11:40:59,682 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c3ba74/9f50bbf0b0ca4f079bc8990798d67f14/FLAG430ca8604 [2023-01-28 11:40:59,694 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c3ba74/9f50bbf0b0ca4f079bc8990798d67f14 [2023-01-28 11:40:59,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 11:40:59,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 11:40:59,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 11:40:59,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 11:40:59,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 11:40:59,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd36137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59, skipping insertion in model container [2023-01-28 11:40:59,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 11:40:59,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 11:40:59,851 WARN L247 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] [2023-01-28 11:40:59,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:40:59,869 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 11:40:59,887 WARN L247 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] [2023-01-28 11:40:59,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 11:40:59,894 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:40:59,894 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 11:40:59,898 INFO L208 MainTranslator]: Completed translation [2023-01-28 11:40:59,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59 WrapperNode [2023-01-28 11:40:59,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 11:40:59,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 11:40:59,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 11:40:59,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 11:40:59,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,922 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-01-28 11:40:59,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 11:40:59,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 11:40:59,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 11:40:59,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 11:40:59,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 11:40:59,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 11:40:59,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 11:40:59,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 11:40:59,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (1/1) ... [2023-01-28 11:40:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 11:40:59,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:40:59,970 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) [2023-01-28 11:40:59,980 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 [2023-01-28 11:40:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 11:40:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 11:40:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 11:40:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 11:40:59,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 11:40:59,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 11:40:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 11:40:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 11:40:59,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 11:40:59,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 11:40:59,996 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 11:41:00,072 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 11:41:00,074 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 11:41:00,359 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 11:41:00,402 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 11:41:00,402 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 11:41:00,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:41:00 BoogieIcfgContainer [2023-01-28 11:41:00,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 11:41:00,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 11:41:00,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 11:41:00,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 11:41:00,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:40:59" (1/3) ... [2023-01-28 11:41:00,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b04a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:41:00, skipping insertion in model container [2023-01-28 11:41:00,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:40:59" (2/3) ... [2023-01-28 11:41:00,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b04a889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:41:00, skipping insertion in model container [2023-01-28 11:41:00,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:41:00" (3/3) ... [2023-01-28 11:41:00,412 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-01-28 11:41:00,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 11:41:00,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 11:41:00,423 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 11:41:00,475 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 11:41:00,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-01-28 11:41:00,546 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-01-28 11:41:00,547 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:41:00,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-01-28 11:41:00,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-01-28 11:41:00,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-01-28 11:41:00,556 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 11:41:00,561 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-28 11:41:00,563 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-28 11:41:00,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-01-28 11:41:00,584 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-01-28 11:41:00,584 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:41:00,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 10/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-01-28 11:41:00,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-01-28 11:41:04,001 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-01-28 11:41:04,001 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-01-28 11:41:04,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 11:41:04,014 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;@c2c3111, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 11:41:04,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 11:41:04,021 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-01-28 11:41:04,021 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 11:41:04,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:04,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:04,022 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)] === [2023-01-28 11:41:04,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-01-28 11:41:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:04,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979579682] [2023-01-28 11:41:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:04,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979579682] [2023-01-28 11:41:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979579682] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:41:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415637191] [2023-01-28 11:41:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:04,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:41:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:41:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:41:04,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-28 11:41:04,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-01-28 11:41:04,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:04,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-28 11:41:04,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:04,454 INFO L130 PetriNetUnfolder]: 214/342 cut-off events. [2023-01-28 11:41:04,454 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-01-28 11:41:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1072 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2023-01-28 11:41:04,457 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-01-28 11:41:04,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-01-28 11:41:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:41:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:41:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-01-28 11:41:04,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491869918699187 [2023-01-28 11:41:04,468 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-01-28 11:41:04,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-01-28 11:41:04,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:04,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-01-28 11:41:04,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-01-28 11:41:04,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-28 11:41:04,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-28 11:41:04,479 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 605 transitions. [2023-01-28 11:41:04,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-01-28 11:41:04,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-28 11:41:04,482 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-01-28 11:41:04,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-01-28 11:41:04,485 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-01-28 11:41:04,486 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-01-28 11:41:04,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-01-28 11:41:04,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:04,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:04,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 11:41:04,486 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)] === [2023-01-28 11:41:04,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 712380104, now seen corresponding path program 2 times [2023-01-28 11:41:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:04,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126185128] [2023-01-28 11:41:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:04,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:04,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126185128] [2023-01-28 11:41:04,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126185128] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:04,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:04,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:41:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325326967] [2023-01-28 11:41:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:04,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:41:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:04,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:41:04,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:41:04,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-28 11:41:04,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-01-28 11:41:04,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:04,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-28 11:41:04,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:04,705 INFO L130 PetriNetUnfolder]: 209/341 cut-off events. [2023-01-28 11:41:04,705 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-01-28 11:41:04,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 341 events. 209/341 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1080 event pairs, 30 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 452. Up to 167 conditions per place. [2023-01-28 11:41:04,708 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-01-28 11:41:04,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-01-28 11:41:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 11:41:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 11:41:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-01-28 11:41:04,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869918699186992 [2023-01-28 11:41:04,710 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-01-28 11:41:04,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-01-28 11:41:04,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:04,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-01-28 11:41:04,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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) [2023-01-28 11:41:04,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-28 11:41:04,714 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-28 11:41:04,715 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 599 transitions. [2023-01-28 11:41:04,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-01-28 11:41:04,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:41:04,717 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-01-28 11:41:04,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-01-28 11:41:04,717 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-28 11:41:04,718 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-01-28 11:41:04,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-01-28 11:41:04,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:04,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:04,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 11:41:04,718 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)] === [2023-01-28 11:41:04,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-01-28 11:41:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347794044] [2023-01-28 11:41:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:04,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347794044] [2023-01-28 11:41:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347794044] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:04,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:04,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 11:41:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499474905] [2023-01-28 11:41:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:04,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 11:41:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 11:41:04,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 11:41:04,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-01-28 11:41:04,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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) [2023-01-28 11:41:04,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:04,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-01-28 11:41:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:04,990 INFO L130 PetriNetUnfolder]: 360/594 cut-off events. [2023-01-28 11:41:04,990 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES. [2023-01-28 11:41:04,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 594 events. 360/594 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2262 event pairs, 43 based on Foata normal form. 20/613 useless extension candidates. Maximal degree in co-relation 1154. Up to 182 conditions per place. [2023-01-28 11:41:04,992 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 52 selfloop transitions, 8 changer transitions 24/84 dead transitions. [2023-01-28 11:41:04,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 475 flow [2023-01-28 11:41:04,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 11:41:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 11:41:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-01-28 11:41:04,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48606271777003485 [2023-01-28 11:41:04,994 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-01-28 11:41:04,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-01-28 11:41:04,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:04,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-01-28 11:41:04,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 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) [2023-01-28 11:41:04,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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) [2023-01-28 11:41:04,999 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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) [2023-01-28 11:41:04,999 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 837 transitions. [2023-01-28 11:41:04,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 475 flow [2023-01-28 11:41:05,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 84 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:41:05,002 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-01-28 11:41:05,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-01-28 11:41:05,002 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-01-28 11:41:05,003 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-01-28 11:41:05,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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) [2023-01-28 11:41:05,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:05,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:05,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 11:41:05,003 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)] === [2023-01-28 11:41:05,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2055038813, now seen corresponding path program 1 times [2023-01-28 11:41:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:05,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410800367] [2023-01-28 11:41:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:05,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410800367] [2023-01-28 11:41:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410800367] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 11:41:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507692120] [2023-01-28 11:41:05,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 11:41:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:05,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 11:41:05,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 11:41:05,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 11:41:05,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-01-28 11:41:05,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:05,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 11:41:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:05,146 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-01-28 11:41:05,146 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-01-28 11:41:05,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 163 events. 80/163 cut-off events. For 323/336 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 457 event pairs, 15 based on Foata normal form. 23/181 useless extension candidates. Maximal degree in co-relation 508. Up to 121 conditions per place. [2023-01-28 11:41:05,148 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-01-28 11:41:05,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-01-28 11:41:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 11:41:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 11:41:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-01-28 11:41:05,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48644986449864497 [2023-01-28 11:41:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-01-28 11:41:05,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-01-28 11:41:05,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:05,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-01-28 11:41:05,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2023-01-28 11:41:05,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-01-28 11:41:05,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-01-28 11:41:05,157 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 359 transitions. [2023-01-28 11:41:05,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-01-28 11:41:05,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-01-28 11:41:05,161 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-01-28 11:41:05,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-01-28 11:41:05,162 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-01-28 11:41:05,162 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-01-28 11:41:05,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-01-28 11:41:05,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:05,163 INFO L208 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] [2023-01-28 11:41:05,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 11:41:05,163 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)] === [2023-01-28 11:41:05,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-01-28 11:41:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235619445] [2023-01-28 11:41:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:41:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235619445] [2023-01-28 11:41:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235619445] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:05,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:05,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:41:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689437502] [2023-01-28 11:41:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:05,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:41:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:41:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:41:05,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-01-28 11:41:05,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-28 11:41:05,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:05,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-01-28 11:41:05,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:05,288 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-01-28 11:41:05,288 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-01-28 11:41:05,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 178 events. 83/178 cut-off events. For 228/250 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 40 based on Foata normal form. 26/197 useless extension candidates. Maximal degree in co-relation 547. Up to 137 conditions per place. [2023-01-28 11:41:05,289 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-01-28 11:41:05,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-01-28 11:41:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:41:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:41:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-01-28 11:41:05,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2023-01-28 11:41:05,290 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-01-28 11:41:05,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-01-28 11:41:05,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:05,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-01-28 11:41:05,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-28 11:41:05,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-28 11:41:05,293 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-28 11:41:05,293 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 447 transitions. [2023-01-28 11:41:05,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-01-28 11:41:05,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 11:41:05,294 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-01-28 11:41:05,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-01-28 11:41:05,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-01-28 11:41:05,295 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-01-28 11:41:05,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-28 11:41:05,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:05,295 INFO L208 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] [2023-01-28 11:41:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 11:41:05,295 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)] === [2023-01-28 11:41:05,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-01-28 11:41:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004488196] [2023-01-28 11:41:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004488196] [2023-01-28 11:41:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004488196] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215303090] [2023-01-28 11:41:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:05,813 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) [2023-01-28 11:41:05,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 11:41:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:05,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 11:41:05,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:06,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:41:06,097 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 [2023-01-28 11:41:06,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 11:41:06,205 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 [2023-01-28 11:41:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:06,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:06,768 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-01-28 11:41:06,832 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-01-28 11:41:06,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:06,861 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 [2023-01-28 11:41:06,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:06,872 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 620 [2023-01-28 11:41:06,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:06,900 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 296 treesize of output 280 [2023-01-28 11:41:06,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:06,913 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 205 treesize of output 201 [2023-01-28 11:41:06,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:06,926 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 260 treesize of output 220 [2023-01-28 11:41:07,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:07,421 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 [2023-01-28 11:41:07,429 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:07,430 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 [2023-01-28 11:41:07,451 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:07,451 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 296 treesize of output 252 [2023-01-28 11:41:07,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:07,463 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 182 treesize of output 170 [2023-01-28 11:41:07,473 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:07,474 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 181 treesize of output 161 [2023-01-28 11:41:07,575 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 11:41:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 11:41:07,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215303090] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:07,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:07,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-01-28 11:41:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610412202] [2023-01-28 11:41:07,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:07,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 11:41:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:07,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 11:41:07,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=615, Unknown=6, NotChecked=106, Total=870 [2023-01-28 11:41:07,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:41:07,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 120 flow. Second operand has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 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) [2023-01-28 11:41:07,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:07,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:41:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:07,753 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~back~0 4)) (.cse12 (* c_~front~0 4))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse4 (+ c_~queue~0.offset .cse12)) (.cse2 (< c_~back~0 0)) (.cse5 (+ c_~queue~0.offset .cse11))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0)) .cse2) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse4)) 1) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse6 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse6 .cse4))))))) .cse0 .cse1 .cse2) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse9 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse10 .cse9)) 1) (not (= (select .cse10 .cse8) 1))))))) .cse2) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse14 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 (let ((.cse13 (+ c_~sum~0 (select .cse14 .cse4)))) (and (<= .cse13 1) (<= 0 .cse13))) .cse2 (not (= (select .cse14 .cse5) 1))))))) is different from false [2023-01-28 11:41:11,051 INFO L130 PetriNetUnfolder]: 1442/2387 cut-off events. [2023-01-28 11:41:11,051 INFO L131 PetriNetUnfolder]: For 2320/2320 co-relation queries the response was YES. [2023-01-28 11:41:11,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 2387 events. 1442/2387 cut-off events. For 2320/2320 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12028 event pairs, 66 based on Foata normal form. 140/2523 useless extension candidates. Maximal degree in co-relation 7441. Up to 465 conditions per place. [2023-01-28 11:41:11,062 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 266 selfloop transitions, 134 changer transitions 57/457 dead transitions. [2023-01-28 11:41:11,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 457 transitions, 2682 flow [2023-01-28 11:41:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-01-28 11:41:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-01-28 11:41:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4980 transitions. [2023-01-28 11:41:11,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27731373204143 [2023-01-28 11:41:11,075 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4980 transitions. [2023-01-28 11:41:11,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4980 transitions. [2023-01-28 11:41:11,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:11,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4980 transitions. [2023-01-28 11:41:11,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 68.21917808219177) internal successors, (4980), 73 states have internal predecessors, (4980), 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) [2023-01-28 11:41:11,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 246.0) internal successors, (18204), 74 states have internal predecessors, (18204), 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) [2023-01-28 11:41:11,107 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 246.0) internal successors, (18204), 74 states have internal predecessors, (18204), 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) [2023-01-28 11:41:11,107 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 73 states and 4980 transitions. [2023-01-28 11:41:11,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 457 transitions, 2682 flow [2023-01-28 11:41:11,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 457 transitions, 2666 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 11:41:11,116 INFO L231 Difference]: Finished difference. Result has 148 places, 174 transitions, 1386 flow [2023-01-28 11:41:11,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=1386, PETRI_PLACES=148, PETRI_TRANSITIONS=174} [2023-01-28 11:41:11,118 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2023-01-28 11:41:11,118 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 174 transitions, 1386 flow [2023-01-28 11:41:11,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 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) [2023-01-28 11:41:11,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:11,119 INFO L208 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] [2023-01-28 11:41:11,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 11:41:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 11:41:11,325 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)] === [2023-01-28 11:41:11,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-01-28 11:41:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073270811] [2023-01-28 11:41:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073270811] [2023-01-28 11:41:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073270811] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136790661] [2023-01-28 11:41:11,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:41:11,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:11,914 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) [2023-01-28 11:41:11,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 11:41:11,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:41:11,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:11,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 11:41:11,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:12,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:41:12,088 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 [2023-01-28 11:41:12,127 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 [2023-01-28 11:41:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:12,260 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 16 treesize of output 18 [2023-01-28 11:41:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:12,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:12,436 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0))))))) is different from false [2023-01-28 11:41:12,471 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2))))))) is different from false [2023-01-28 11:41:12,534 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-01-28 11:41:12,599 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-01-28 11:41:12,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:12,744 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 [2023-01-28 11:41:12,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:12,753 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 484 treesize of output 460 [2023-01-28 11:41:12,768 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 [2023-01-28 11:41:12,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:12,782 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 126 treesize of output 122 [2023-01-28 11:41:12,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:12,794 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 125 treesize of output 109 [2023-01-28 11:41:13,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:13,015 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 [2023-01-28 11:41:13,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:41:13,022 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:13,022 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 [2023-01-28 11:41:13,032 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:13,032 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 [2023-01-28 11:41:13,042 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:13,043 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 [2023-01-28 11:41:13,076 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 11:41:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 11:41:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136790661] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:13,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:13,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-01-28 11:41:13,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595140791] [2023-01-28 11:41:13,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 11:41:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:13,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 11:41:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=586, Unknown=5, NotChecked=212, Total=930 [2023-01-28 11:41:13,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:41:13,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 174 transitions, 1386 flow. Second operand has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 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) [2023-01-28 11:41:13,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:13,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:41:13,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:13,332 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse6 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)) 1)) (not (= (select (select .cse2 c_~queue~0.base) .cse4) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse5 c_~queue~0.base) .cse4) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)))))))) .cse6) (or .cse1 .cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse4) 1))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-28 11:41:13,441 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-28 11:41:14,341 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~back~0)) (.cse1 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (or (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-28 11:41:19,640 INFO L130 PetriNetUnfolder]: 2114/3527 cut-off events. [2023-01-28 11:41:19,640 INFO L131 PetriNetUnfolder]: For 100378/100378 co-relation queries the response was YES. [2023-01-28 11:41:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23765 conditions, 3527 events. 2114/3527 cut-off events. For 100378/100378 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19528 event pairs, 147 based on Foata normal form. 90/3615 useless extension candidates. Maximal degree in co-relation 23716. Up to 809 conditions per place. [2023-01-28 11:41:19,670 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 317 selfloop transitions, 192 changer transitions 86/595 dead transitions. [2023-01-28 11:41:19,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 595 transitions, 6493 flow [2023-01-28 11:41:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 11:41:19,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 11:41:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3252 transitions. [2023-01-28 11:41:19,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27540650406504064 [2023-01-28 11:41:19,677 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3252 transitions. [2023-01-28 11:41:19,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3252 transitions. [2023-01-28 11:41:19,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:19,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3252 transitions. [2023-01-28 11:41:19,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 67.75) internal successors, (3252), 48 states have internal predecessors, (3252), 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) [2023-01-28 11:41:19,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 246.0) internal successors, (12054), 49 states have internal predecessors, (12054), 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) [2023-01-28 11:41:19,694 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 246.0) internal successors, (12054), 49 states have internal predecessors, (12054), 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) [2023-01-28 11:41:19,694 INFO L175 Difference]: Start difference. First operand has 148 places, 174 transitions, 1386 flow. Second operand 48 states and 3252 transitions. [2023-01-28 11:41:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 595 transitions, 6493 flow [2023-01-28 11:41:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 595 transitions, 5815 flow, removed 315 selfloop flow, removed 8 redundant places. [2023-01-28 11:41:19,857 INFO L231 Difference]: Finished difference. Result has 207 places, 307 transitions, 3046 flow [2023-01-28 11:41:19,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3046, PETRI_PLACES=207, PETRI_TRANSITIONS=307} [2023-01-28 11:41:19,857 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2023-01-28 11:41:19,858 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 307 transitions, 3046 flow [2023-01-28 11:41:19,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 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) [2023-01-28 11:41:19,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:19,858 INFO L208 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] [2023-01-28 11:41:19,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:20,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-01-28 11:41:20,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:20,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1429573320, now seen corresponding path program 3 times [2023-01-28 11:41:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:20,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014682362] [2023-01-28 11:41:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014682362] [2023-01-28 11:41:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014682362] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629965602] [2023-01-28 11:41:20,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:41:20,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:20,656 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) [2023-01-28 11:41:20,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 11:41:20,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 11:41:20,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:20,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 11:41:20,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:20,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:41:20,832 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 [2023-01-28 11:41:20,878 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 [2023-01-28 11:41:21,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:21,026 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 16 treesize of output 18 [2023-01-28 11:41:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:21,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:21,193 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:41:21,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:21,793 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 [2023-01-28 11:41:21,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:21,801 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 402 treesize of output 386 [2023-01-28 11:41:21,813 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 74 treesize of output 50 [2023-01-28 11:41:21,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:21,832 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 138 treesize of output 122 [2023-01-28 11:41:21,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:21,841 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 114 treesize of output 110 [2023-01-28 11:41:22,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:22,020 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 [2023-01-28 11:41:22,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:41:22,028 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:22,028 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 316 treesize of output 288 [2023-01-28 11:41:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:22,042 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 96 treesize of output 84 [2023-01-28 11:41:22,058 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 11:41:22,058 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 95 treesize of output 75 [2023-01-28 11:41:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629965602] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:22,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-01-28 11:41:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96647789] [2023-01-28 11:41:22,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:22,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 11:41:22,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 11:41:22,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=761, Unknown=21, NotChecked=58, Total=992 [2023-01-28 11:41:22,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:41:22,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 307 transitions, 3046 flow. Second operand has 32 states, 32 states have (on average 63.78125) internal successors, (2041), 32 states have internal predecessors, (2041), 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) [2023-01-28 11:41:22,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:22,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:41:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:24,885 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2))))))) (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2)) 1)) (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-28 11:41:25,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse5 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse5))))))) (.cse4 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 .cse2 .cse3 .cse4) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse4) (or .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-28 11:41:26,416 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~queue~0.offset (* c_~back~0 4)))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) .cse9)) (.cse10 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse3 (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse10)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse10)))))) (.cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse2 (not (= .cse1 1))) (.cse7 (= (mod c_~v_assert~0 256) 0)) (.cse4 (<= c_~n~0 c_~back~0)) (.cse5 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 .cse2))) .cse3 .cse4 .cse5 .cse6) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or .cse3 .cse7 .cse4 .cse5 .cse2) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (not (= (select (select .cse8 c_~queue~0.base) .cse9) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse10))))))) (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse10)) 1)) (not (= (select (select .cse11 c_~queue~0.base) .cse9) 1)))))) .cse7 .cse4 .cse5) (<= c_~sum~0 1) (or .cse3 .cse4 .cse5 .cse6 .cse2) (or .cse7 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))))) is different from false [2023-01-28 11:41:29,593 INFO L130 PetriNetUnfolder]: 2398/4012 cut-off events. [2023-01-28 11:41:29,593 INFO L131 PetriNetUnfolder]: For 151378/151378 co-relation queries the response was YES. [2023-01-28 11:41:29,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31924 conditions, 4012 events. 2398/4012 cut-off events. For 151378/151378 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22969 event pairs, 182 based on Foata normal form. 98/4101 useless extension candidates. Maximal degree in co-relation 31855. Up to 1238 conditions per place. [2023-01-28 11:41:29,632 INFO L137 encePairwiseOnDemand]: 226/246 looper letters, 307 selfloop transitions, 270 changer transitions 101/678 dead transitions. [2023-01-28 11:41:29,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 678 transitions, 8882 flow [2023-01-28 11:41:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-01-28 11:41:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-01-28 11:41:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4363 transitions. [2023-01-28 11:41:29,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2728580362726704 [2023-01-28 11:41:29,637 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 4363 transitions. [2023-01-28 11:41:29,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 4363 transitions. [2023-01-28 11:41:29,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:29,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 4363 transitions. [2023-01-28 11:41:29,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 67.12307692307692) internal successors, (4363), 65 states have internal predecessors, (4363), 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) [2023-01-28 11:41:29,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 246.0) internal successors, (16236), 66 states have internal predecessors, (16236), 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) [2023-01-28 11:41:29,665 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 246.0) internal successors, (16236), 66 states have internal predecessors, (16236), 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) [2023-01-28 11:41:29,665 INFO L175 Difference]: Start difference. First operand has 207 places, 307 transitions, 3046 flow. Second operand 65 states and 4363 transitions. [2023-01-28 11:41:29,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 678 transitions, 8882 flow [2023-01-28 11:41:29,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 678 transitions, 8341 flow, removed 247 selfloop flow, removed 19 redundant places. [2023-01-28 11:41:29,997 INFO L231 Difference]: Finished difference. Result has 282 places, 387 transitions, 4659 flow [2023-01-28 11:41:29,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=4659, PETRI_PLACES=282, PETRI_TRANSITIONS=387} [2023-01-28 11:41:29,998 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 251 predicate places. [2023-01-28 11:41:29,998 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 387 transitions, 4659 flow [2023-01-28 11:41:29,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 63.78125) internal successors, (2041), 32 states have internal predecessors, (2041), 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) [2023-01-28 11:41:29,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:29,999 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:30,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:30,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:30,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:30,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -578987259, now seen corresponding path program 4 times [2023-01-28 11:41:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035269085] [2023-01-28 11:41:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035269085] [2023-01-28 11:41:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035269085] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080199518] [2023-01-28 11:41:31,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:41:31,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:31,097 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) [2023-01-28 11:41:31,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 11:41:31,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:41:31,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:31,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-28 11:41:31,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:41:31,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:31,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:31,454 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 68 treesize of output 44 [2023-01-28 11:41:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:41:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080199518] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:31,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2023-01-28 11:41:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044652138] [2023-01-28 11:41:31,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:31,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 11:41:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 11:41:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2023-01-28 11:41:31,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-28 11:41:31,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 387 transitions, 4659 flow. Second operand has 25 states, 25 states have (on average 74.48) internal successors, (1862), 25 states have internal predecessors, (1862), 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) [2023-01-28 11:41:31,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:31,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-28 11:41:31,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:33,622 INFO L130 PetriNetUnfolder]: 2572/4301 cut-off events. [2023-01-28 11:41:33,622 INFO L131 PetriNetUnfolder]: For 227498/227498 co-relation queries the response was YES. [2023-01-28 11:41:33,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42634 conditions, 4301 events. 2572/4301 cut-off events. For 227498/227498 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 24655 event pairs, 140 based on Foata normal form. 56/4356 useless extension candidates. Maximal degree in co-relation 42537. Up to 1352 conditions per place. [2023-01-28 11:41:33,664 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 301 selfloop transitions, 300 changer transitions 41/642 dead transitions. [2023-01-28 11:41:33,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 642 transitions, 9869 flow [2023-01-28 11:41:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-28 11:41:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-28 11:41:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2716 transitions. [2023-01-28 11:41:33,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3154471544715447 [2023-01-28 11:41:33,667 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2716 transitions. [2023-01-28 11:41:33,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2716 transitions. [2023-01-28 11:41:33,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:33,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2716 transitions. [2023-01-28 11:41:33,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 77.6) internal successors, (2716), 35 states have internal predecessors, (2716), 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) [2023-01-28 11:41:33,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 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) [2023-01-28 11:41:33,676 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 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) [2023-01-28 11:41:33,676 INFO L175 Difference]: Start difference. First operand has 282 places, 387 transitions, 4659 flow. Second operand 35 states and 2716 transitions. [2023-01-28 11:41:33,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 642 transitions, 9869 flow [2023-01-28 11:41:34,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 642 transitions, 9068 flow, removed 346 selfloop flow, removed 32 redundant places. [2023-01-28 11:41:34,257 INFO L231 Difference]: Finished difference. Result has 285 places, 457 transitions, 5881 flow [2023-01-28 11:41:34,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=4079, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5881, PETRI_PLACES=285, PETRI_TRANSITIONS=457} [2023-01-28 11:41:34,257 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 254 predicate places. [2023-01-28 11:41:34,257 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 457 transitions, 5881 flow [2023-01-28 11:41:34,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 74.48) internal successors, (1862), 25 states have internal predecessors, (1862), 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) [2023-01-28 11:41:34,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:34,258 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:34,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:34,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:34,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:34,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash -814467891, now seen corresponding path program 5 times [2023-01-28 11:41:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:34,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18850052] [2023-01-28 11:41:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18850052] [2023-01-28 11:41:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18850052] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896459514] [2023-01-28 11:41:35,186 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:41:35,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:35,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:35,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:41:35,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 11:41:35,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:41:35,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:35,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 11:41:35,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:35,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:35,442 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 [2023-01-28 11:41:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:41:35,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:35,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:35,653 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 110 treesize of output 86 [2023-01-28 11:41:35,657 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 53 treesize of output 47 [2023-01-28 11:41:35,660 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 47 treesize of output 41 [2023-01-28 11:41:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:41:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896459514] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:35,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2023-01-28 11:41:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290679319] [2023-01-28 11:41:35,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:35,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 11:41:35,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 11:41:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=595, Unknown=7, NotChecked=0, Total=702 [2023-01-28 11:41:35,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-01-28 11:41:35,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 457 transitions, 5881 flow. Second operand has 27 states, 27 states have (on average 72.14814814814815) internal successors, (1948), 27 states have internal predecessors, (1948), 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) [2023-01-28 11:41:35,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:35,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-01-28 11:41:35,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:37,512 INFO L130 PetriNetUnfolder]: 2888/4841 cut-off events. [2023-01-28 11:41:37,512 INFO L131 PetriNetUnfolder]: For 243955/243955 co-relation queries the response was YES. [2023-01-28 11:41:37,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49211 conditions, 4841 events. 2888/4841 cut-off events. For 243955/243955 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 28466 event pairs, 177 based on Foata normal form. 82/4914 useless extension candidates. Maximal degree in co-relation 49115. Up to 1577 conditions per place. [2023-01-28 11:41:37,600 INFO L137 encePairwiseOnDemand]: 237/246 looper letters, 312 selfloop transitions, 175 changer transitions 206/693 dead transitions. [2023-01-28 11:41:37,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 693 transitions, 10916 flow [2023-01-28 11:41:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 11:41:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 11:41:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1308 transitions. [2023-01-28 11:41:37,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3127690100430416 [2023-01-28 11:41:37,605 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1308 transitions. [2023-01-28 11:41:37,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1308 transitions. [2023-01-28 11:41:37,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:37,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1308 transitions. [2023-01-28 11:41:37,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 76.94117647058823) internal successors, (1308), 17 states have internal predecessors, (1308), 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) [2023-01-28 11:41:37,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 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) [2023-01-28 11:41:37,613 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 246.0) internal successors, (4428), 18 states have internal predecessors, (4428), 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) [2023-01-28 11:41:37,614 INFO L175 Difference]: Start difference. First operand has 285 places, 457 transitions, 5881 flow. Second operand 17 states and 1308 transitions. [2023-01-28 11:41:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 693 transitions, 10916 flow [2023-01-28 11:41:38,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 693 transitions, 10124 flow, removed 142 selfloop flow, removed 20 redundant places. [2023-01-28 11:41:38,084 INFO L231 Difference]: Finished difference. Result has 281 places, 396 transitions, 5157 flow [2023-01-28 11:41:38,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=5225, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5157, PETRI_PLACES=281, PETRI_TRANSITIONS=396} [2023-01-28 11:41:38,085 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 250 predicate places. [2023-01-28 11:41:38,085 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 396 transitions, 5157 flow [2023-01-28 11:41:38,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 72.14814814814815) internal successors, (1948), 27 states have internal predecessors, (1948), 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) [2023-01-28 11:41:38,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:38,086 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:38,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:38,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 11:41:38,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:38,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:38,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1297298077, now seen corresponding path program 6 times [2023-01-28 11:41:38,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:38,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54433714] [2023-01-28 11:41:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:38,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54433714] [2023-01-28 11:41:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54433714] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:38,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949147689] [2023-01-28 11:41:38,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:41:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:38,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:38,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:41:38,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 11:41:38,551 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-28 11:41:38,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:38,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-28 11:41:38,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:38,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949147689] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:38,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-28 11:41:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372004482] [2023-01-28 11:41:38,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 11:41:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 11:41:38,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-01-28 11:41:38,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 246 [2023-01-28 11:41:38,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 396 transitions, 5157 flow. Second operand has 17 states, 17 states have (on average 102.82352941176471) internal successors, (1748), 17 states have internal predecessors, (1748), 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) [2023-01-28 11:41:38,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:38,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 246 [2023-01-28 11:41:38,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:39,225 INFO L130 PetriNetUnfolder]: 1045/1994 cut-off events. [2023-01-28 11:41:39,226 INFO L131 PetriNetUnfolder]: For 137987/138285 co-relation queries the response was YES. [2023-01-28 11:41:39,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21799 conditions, 1994 events. 1045/1994 cut-off events. For 137987/138285 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11979 event pairs, 286 based on Foata normal form. 165/2084 useless extension candidates. Maximal degree in co-relation 21708. Up to 970 conditions per place. [2023-01-28 11:41:39,246 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 168 selfloop transitions, 3 changer transitions 67/309 dead transitions. [2023-01-28 11:41:39,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 309 transitions, 4606 flow [2023-01-28 11:41:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 11:41:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 11:41:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 847 transitions. [2023-01-28 11:41:39,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303861788617886 [2023-01-28 11:41:39,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 847 transitions. [2023-01-28 11:41:39,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 847 transitions. [2023-01-28 11:41:39,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:39,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 847 transitions. [2023-01-28 11:41:39,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 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) [2023-01-28 11:41:39,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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) [2023-01-28 11:41:39,254 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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) [2023-01-28 11:41:39,254 INFO L175 Difference]: Start difference. First operand has 281 places, 396 transitions, 5157 flow. Second operand 8 states and 847 transitions. [2023-01-28 11:41:39,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 309 transitions, 4606 flow [2023-01-28 11:41:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 309 transitions, 4107 flow, removed 139 selfloop flow, removed 29 redundant places. [2023-01-28 11:41:39,489 INFO L231 Difference]: Finished difference. Result has 234 places, 242 transitions, 2898 flow [2023-01-28 11:41:39,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3339, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2898, PETRI_PLACES=234, PETRI_TRANSITIONS=242} [2023-01-28 11:41:39,490 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2023-01-28 11:41:39,490 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 242 transitions, 2898 flow [2023-01-28 11:41:39,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 102.82352941176471) internal successors, (1748), 17 states have internal predecessors, (1748), 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) [2023-01-28 11:41:39,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:39,490 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:39,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:39,697 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:39,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2022178986, now seen corresponding path program 7 times [2023-01-28 11:41:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353146630] [2023-01-28 11:41:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:41:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:39,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353146630] [2023-01-28 11:41:39,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353146630] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 11:41:39,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 11:41:39,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 11:41:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526009657] [2023-01-28 11:41:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 11:41:39,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 11:41:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 11:41:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 11:41:39,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-01-28 11:41:39,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 242 transitions, 2898 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-01-28 11:41:39,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:39,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-01-28 11:41:39,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:40,231 INFO L130 PetriNetUnfolder]: 1360/2616 cut-off events. [2023-01-28 11:41:40,231 INFO L131 PetriNetUnfolder]: For 96850/97295 co-relation queries the response was YES. [2023-01-28 11:41:40,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24459 conditions, 2616 events. 1360/2616 cut-off events. For 96850/97295 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15970 event pairs, 181 based on Foata normal form. 184/2719 useless extension candidates. Maximal degree in co-relation 24388. Up to 975 conditions per place. [2023-01-28 11:41:40,261 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 196 selfloop transitions, 83 changer transitions 0/350 dead transitions. [2023-01-28 11:41:40,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 350 transitions, 4936 flow [2023-01-28 11:41:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 11:41:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 11:41:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 11:41:40,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132113821138211 [2023-01-28 11:41:40,262 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 11:41:40,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 11:41:40,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:40,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 11:41:40,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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) [2023-01-28 11:41:40,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-28 11:41:40,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-28 11:41:40,264 INFO L175 Difference]: Start difference. First operand has 234 places, 242 transitions, 2898 flow. Second operand 4 states and 505 transitions. [2023-01-28 11:41:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 350 transitions, 4936 flow [2023-01-28 11:41:40,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 350 transitions, 4635 flow, removed 87 selfloop flow, removed 18 redundant places. [2023-01-28 11:41:40,341 INFO L231 Difference]: Finished difference. Result has 188 places, 296 transitions, 3975 flow [2023-01-28 11:41:40,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3975, PETRI_PLACES=188, PETRI_TRANSITIONS=296} [2023-01-28 11:41:40,341 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2023-01-28 11:41:40,341 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 296 transitions, 3975 flow [2023-01-28 11:41:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-01-28 11:41:40,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:40,342 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:40,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 11:41:40,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:40,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash -148965548, now seen corresponding path program 8 times [2023-01-28 11:41:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:40,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191762196] [2023-01-28 11:41:40,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:41,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191762196] [2023-01-28 11:41:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191762196] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780561472] [2023-01-28 11:41:41,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:41:41,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:41,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:41,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:41:41,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 11:41:41,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:41:41,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:41,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 11:41:41,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:41,485 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 12 treesize of output 3 [2023-01-28 11:41:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:41,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:41,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:41,794 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 68 treesize of output 44 [2023-01-28 11:41:42,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:42,186 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 211 treesize of output 155 [2023-01-28 11:41:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:42,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780561472] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:41:42,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:41:42,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 35 [2023-01-28 11:41:42,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724129793] [2023-01-28 11:41:42,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:41:42,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-28 11:41:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:41:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-28 11:41:42,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2023-01-28 11:41:42,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 246 [2023-01-28 11:41:42,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 296 transitions, 3975 flow. Second operand has 36 states, 36 states have (on average 76.0) internal successors, (2736), 36 states have internal predecessors, (2736), 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) [2023-01-28 11:41:42,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:41:42,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 246 [2023-01-28 11:41:42,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:41:48,335 INFO L130 PetriNetUnfolder]: 6036/10722 cut-off events. [2023-01-28 11:41:48,335 INFO L131 PetriNetUnfolder]: For 169943/169943 co-relation queries the response was YES. [2023-01-28 11:41:48,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81068 conditions, 10722 events. 6036/10722 cut-off events. For 169943/169943 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 74313 event pairs, 274 based on Foata normal form. 318/11040 useless extension candidates. Maximal degree in co-relation 81009. Up to 3449 conditions per place. [2023-01-28 11:41:48,415 INFO L137 encePairwiseOnDemand]: 236/246 looper letters, 769 selfloop transitions, 500 changer transitions 173/1442 dead transitions. [2023-01-28 11:41:48,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1442 transitions, 21254 flow [2023-01-28 11:41:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-01-28 11:41:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-01-28 11:41:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 5644 transitions. [2023-01-28 11:41:48,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3325085424767291 [2023-01-28 11:41:48,420 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 5644 transitions. [2023-01-28 11:41:48,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 5644 transitions. [2023-01-28 11:41:48,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:41:48,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 5644 transitions. [2023-01-28 11:41:48,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 81.79710144927536) internal successors, (5644), 69 states have internal predecessors, (5644), 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) [2023-01-28 11:41:48,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 246.0) internal successors, (17220), 70 states have internal predecessors, (17220), 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) [2023-01-28 11:41:48,437 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 246.0) internal successors, (17220), 70 states have internal predecessors, (17220), 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) [2023-01-28 11:41:48,437 INFO L175 Difference]: Start difference. First operand has 188 places, 296 transitions, 3975 flow. Second operand 69 states and 5644 transitions. [2023-01-28 11:41:48,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1442 transitions, 21254 flow [2023-01-28 11:41:48,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 1442 transitions, 21019 flow, removed 110 selfloop flow, removed 1 redundant places. [2023-01-28 11:41:48,805 INFO L231 Difference]: Finished difference. Result has 273 places, 691 transitions, 11661 flow [2023-01-28 11:41:48,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3896, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=11661, PETRI_PLACES=273, PETRI_TRANSITIONS=691} [2023-01-28 11:41:48,806 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2023-01-28 11:41:48,806 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 691 transitions, 11661 flow [2023-01-28 11:41:48,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 76.0) internal successors, (2736), 36 states have internal predecessors, (2736), 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) [2023-01-28 11:41:48,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:41:48,806 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:41:48,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 11:41:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:49,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:41:49,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:41:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash -875986392, now seen corresponding path program 9 times [2023-01-28 11:41:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:41:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919559739] [2023-01-28 11:41:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:41:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:41:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:41:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:41:49,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919559739] [2023-01-28 11:41:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919559739] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:41:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085540026] [2023-01-28 11:41:49,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:41:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:41:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:41:49,873 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:41:49,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 11:41:49,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-28 11:41:49,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:41:49,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 11:41:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:41:50,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:41:50,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:41:50,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:41:50,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 36 treesize of output 17 [2023-01-28 11:41:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:41:50,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:41:51,564 INFO L321 Elim1Store]: treesize reduction 16, result has 90.5 percent of original size [2023-01-28 11:41:51,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 335 treesize of output 375 [2023-01-28 11:43:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:43:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085540026] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:43:46,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:43:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2023-01-28 11:43:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401061242] [2023-01-28 11:43:46,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:43:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-28 11:43:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:43:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-28 11:43:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2023-01-28 11:43:46,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-28 11:43:46,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 691 transitions, 11661 flow. Second operand has 35 states, 35 states have (on average 74.05714285714286) internal successors, (2592), 35 states have internal predecessors, (2592), 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) [2023-01-28 11:43:46,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:43:46,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-28 11:43:46,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:43:55,870 INFO L130 PetriNetUnfolder]: 7757/13802 cut-off events. [2023-01-28 11:43:55,870 INFO L131 PetriNetUnfolder]: For 276051/276051 co-relation queries the response was YES. [2023-01-28 11:43:55,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114381 conditions, 13802 events. 7757/13802 cut-off events. For 276051/276051 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 100979 event pairs, 362 based on Foata normal form. 326/14128 useless extension candidates. Maximal degree in co-relation 114304. Up to 4609 conditions per place. [2023-01-28 11:43:55,982 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 781 selfloop transitions, 618 changer transitions 559/1958 dead transitions. [2023-01-28 11:43:55,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1958 transitions, 32400 flow [2023-01-28 11:43:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-01-28 11:43:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-01-28 11:43:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 6959 transitions. [2023-01-28 11:43:55,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32146156688839617 [2023-01-28 11:43:55,988 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 6959 transitions. [2023-01-28 11:43:55,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 6959 transitions. [2023-01-28 11:43:55,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:43:55,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 6959 transitions. [2023-01-28 11:43:55,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 79.07954545454545) internal successors, (6959), 88 states have internal predecessors, (6959), 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) [2023-01-28 11:43:56,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 246.0) internal successors, (21894), 89 states have internal predecessors, (21894), 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) [2023-01-28 11:43:56,006 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 246.0) internal successors, (21894), 89 states have internal predecessors, (21894), 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) [2023-01-28 11:43:56,006 INFO L175 Difference]: Start difference. First operand has 273 places, 691 transitions, 11661 flow. Second operand 88 states and 6959 transitions. [2023-01-28 11:43:56,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1958 transitions, 32400 flow [2023-01-28 11:43:57,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1958 transitions, 30291 flow, removed 916 selfloop flow, removed 7 redundant places. [2023-01-28 11:43:57,154 INFO L231 Difference]: Finished difference. Result has 393 places, 949 transitions, 16882 flow [2023-01-28 11:43:57,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=10661, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=16882, PETRI_PLACES=393, PETRI_TRANSITIONS=949} [2023-01-28 11:43:57,154 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 362 predicate places. [2023-01-28 11:43:57,154 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 949 transitions, 16882 flow [2023-01-28 11:43:57,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 74.05714285714286) internal successors, (2592), 35 states have internal predecessors, (2592), 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) [2023-01-28 11:43:57,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:43:57,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:43:57,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 11:43:57,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 11:43:57,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:43:57,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:43:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash 269020960, now seen corresponding path program 10 times [2023-01-28 11:43:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:43:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526856086] [2023-01-28 11:43:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:43:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:43:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:43:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:43:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:43:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526856086] [2023-01-28 11:43:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526856086] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:43:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141759953] [2023-01-28 11:43:58,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:43:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:43:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:43:58,113 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:43:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 11:43:58,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:43:58,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:43:58,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 55 conjunts are in the unsatisfiable core [2023-01-28 11:43:58,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:43:58,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 11:43:58,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 11:43:58,384 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 [2023-01-28 11:43:58,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:43:58,562 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 [2023-01-28 11:43:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:43:58,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:43:59,152 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (let ((.cse9 (* c_~front~0 4)) (.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse0)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset .cse9))) (and (or .cse0 (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (select .cse1 .cse4) 1)))))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse4) 1) 0)) (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse4) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)))))) .cse6) (or .cse0 (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (select .cse8 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:43:59,401 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (<= c_~n~0 (+ c_~back~0 1))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse11 4)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) (and (or (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse4 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))))))) .cse5 .cse6 (not (= .cse7 1))) (or (not .cse5) .cse6 (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (select .cse8 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (select .cse9 .cse1) 1)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1))))) (not (= (+ .cse7 1) 0)))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:43:59,514 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6 4)) (.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse4 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))))))))) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse6)) 1)))) is different from false [2023-01-28 11:43:59,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:43:59,779 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 132 treesize of output 96 [2023-01-28 11:43:59,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:43:59,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3510 treesize of output 3322 [2023-01-28 11:43:59,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:43:59,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 330 treesize of output 340 [2023-01-28 11:43:59,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:43:59,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 304 treesize of output 288 [2023-01-28 11:43:59,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:43:59,902 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 257 treesize of output 195 [2023-01-28 11:44:01,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:01,019 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 132 treesize of output 96 [2023-01-28 11:44:01,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:44:01,037 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:01,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2023-01-28 11:44:01,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:44:01,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:44:01,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:44:01,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-01-28 11:44:01,071 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:01,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-01-28 11:44:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-01-28 11:44:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141759953] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:44:01,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:44:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 40 [2023-01-28 11:44:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822495628] [2023-01-28 11:44:01,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:44:01,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 11:44:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:44:01,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 11:44:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1180, Unknown=7, NotChecked=222, Total=1640 [2023-01-28 11:44:01,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:44:01,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 949 transitions, 16882 flow. Second operand has 41 states, 41 states have (on average 63.829268292682926) internal successors, (2617), 41 states have internal predecessors, (2617), 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) [2023-01-28 11:44:01,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:44:01,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:44:01,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:44:01,730 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4)) (.cse13 (* c_~back~0 4))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse6 (+ c_~queue~0.offset .cse13 4)) (.cse4 (+ c_~queue~0.offset .cse14 4)) (.cse5 (+ c_~queue~0.offset .cse14)) (.cse1 (<= c_~n~0 (+ c_~back~0 1))) (.cse2 (< c_~back~0 0)) (.cse8 (+ c_~queue~0.offset .cse13))) (and (or .cse0 .cse1 .cse2 (and (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse3 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5))) (not (= (+ 1 (select .cse3 .cse6)) 0))))) (not (= (select (select .cse7 c_~queue~0.base) .cse8) 1))))) (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse9 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse4) (select .cse9 .cse5)) 1) (not (= (+ 1 (select .cse9 .cse6)) 0))))) (not (= (select (select .cse10 c_~queue~0.base) .cse8) 1))))))) (<= c_~v_assert~0 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse0 .cse1 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse11 .cse6) 1) 0)) (<= (+ c_~sum~0 (select .cse11 .cse4) (select .cse11 .cse5)) 1)))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse6) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse4) (select .cse12 .cse5))))))) .cse1 .cse2 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse8) 1))) (<= 1 c_~v_assert~0) (= c_~sum~0 0)))) is different from false [2023-01-28 11:44:01,992 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (let ((.cse8 (* c_~back~0 4)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse5 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (+ 1 (select .cse0 .cse3)) 0))))) (not (= (select (select .cse4 c_~queue~0.base) .cse5) 1))))) (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse6 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2)) 1) (not (= (+ 1 (select .cse6 .cse3)) 0))))) (not (= (select (select .cse7 c_~queue~0.base) .cse5) 1))))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-01-28 11:44:02,629 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse9 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse15))) (.cse5 (+ c_~queue~0.offset .cse15 4)) (.cse6 (+ c_~queue~0.offset .cse14 4)) (.cse7 (+ c_~queue~0.offset .cse14))) (let ((.cse0 (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse5) 1) 0)) (<= (+ c_~sum~0 (select .cse12 .cse6) (select .cse12 .cse7)) 1)))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse13 .cse5) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse13 .cse6) (select .cse13 .cse7)))))))) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse10 (< c_~back~0 0)) (.cse11 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse3 (not (= .cse9 1)))) (and (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not .cse1) .cse2 (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (select .cse4 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse4 .cse6) (select .cse4 .cse7)))))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (select .cse8 .cse5) 1)) (<= (+ c_~sum~0 (select .cse8 .cse6) (select .cse8 .cse7)) 1))))) (not (= (+ .cse9 1) 0))))) (<= c_~n~0 c_~back~0) .cse10 .cse11) (or .cse0 .cse2 .cse10 .cse11 .cse3))))) is different from false [2023-01-28 11:44:02,716 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4)) (.cse13 (* c_~back~0 4))) (let ((.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse7 (+ c_~queue~0.offset .cse13 4)) (.cse5 (+ c_~queue~0.offset .cse14 4)) (.cse6 (+ c_~queue~0.offset .cse14)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse3 (< c_~back~0 0)) (.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~queue~0.offset .cse13)) (.cse16 (<= 0 c_~sum~0)) (.cse15 (<= c_~sum~0 1)) (.cse0 (div |c_thread2Thread1of1ForFork0_~b~0#1| 256))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (< 0 (+ .cse0 1)) (or .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse4 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))) (not (= (+ 1 (select .cse4 .cse7)) 0))))) (not (= (select (select .cse8 c_~queue~0.base) .cse9) 1))))) (forall ((v_ArrVal_560 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560))) (or (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse10 .cse5) (select .cse10 .cse6)) 1) (not (= (+ 1 (select .cse10 .cse7)) 0))))) (not (= (select (select .cse11 c_~queue~0.base) .cse9) 1))))))) (<= c_~v_assert~0 1) (or (<= c_~n~0 c_~back~0) (and (<= 1 c_~sum~0) (= (select .cse12 .cse13) (select .cse12 .cse14)) .cse15)) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse16 .cse15) .cse1 .cse2 .cse3 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse17 .cse7) 1) 0)) (<= (+ c_~sum~0 (select .cse17 .cse5) (select .cse17 .cse6)) 1)))) (forall ((v_ArrVal_561 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_561) c_~queue~0.base))) (or (not (= (+ (select .cse18 .cse7) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse18 .cse5) (select .cse18 .cse6))))))) .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (not (= (select .cse12 .cse9) 1))) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) .cse16 .cse15 (<= |c_thread2Thread1of1ForFork0_~b~0#1| (* .cse0 256))))) is different from false [2023-01-28 11:44:10,986 INFO L130 PetriNetUnfolder]: 9282/15880 cut-off events. [2023-01-28 11:44:10,987 INFO L131 PetriNetUnfolder]: For 475313/475313 co-relation queries the response was YES. [2023-01-28 11:44:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147547 conditions, 15880 events. 9282/15880 cut-off events. For 475313/475313 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 114986 event pairs, 1017 based on Foata normal form. 576/16456 useless extension candidates. Maximal degree in co-relation 147429. Up to 5241 conditions per place. [2023-01-28 11:44:11,130 INFO L137 encePairwiseOnDemand]: 230/246 looper letters, 703 selfloop transitions, 732 changer transitions 392/1827 dead transitions. [2023-01-28 11:44:11,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1827 transitions, 35951 flow [2023-01-28 11:44:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-01-28 11:44:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-01-28 11:44:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 5786 transitions. [2023-01-28 11:44:11,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27349215352618644 [2023-01-28 11:44:11,135 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 5786 transitions. [2023-01-28 11:44:11,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 5786 transitions. [2023-01-28 11:44:11,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:44:11,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 5786 transitions. [2023-01-28 11:44:11,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 67.27906976744185) internal successors, (5786), 86 states have internal predecessors, (5786), 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) [2023-01-28 11:44:11,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 246.0) internal successors, (21402), 87 states have internal predecessors, (21402), 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) [2023-01-28 11:44:11,150 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 246.0) internal successors, (21402), 87 states have internal predecessors, (21402), 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) [2023-01-28 11:44:11,151 INFO L175 Difference]: Start difference. First operand has 393 places, 949 transitions, 16882 flow. Second operand 86 states and 5786 transitions. [2023-01-28 11:44:11,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1827 transitions, 35951 flow [2023-01-28 11:44:14,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 1827 transitions, 33372 flow, removed 1101 selfloop flow, removed 33 redundant places. [2023-01-28 11:44:14,172 INFO L231 Difference]: Finished difference. Result has 469 places, 1052 transitions, 20605 flow [2023-01-28 11:44:14,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=14124, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=460, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=20605, PETRI_PLACES=469, PETRI_TRANSITIONS=1052} [2023-01-28 11:44:14,173 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 438 predicate places. [2023-01-28 11:44:14,173 INFO L495 AbstractCegarLoop]: Abstraction has has 469 places, 1052 transitions, 20605 flow [2023-01-28 11:44:14,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 63.829268292682926) internal successors, (2617), 41 states have internal predecessors, (2617), 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) [2023-01-28 11:44:14,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:44:14,174 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:44:14,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 11:44:14,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 11:44:14,376 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:44:14,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:44:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash -287983700, now seen corresponding path program 11 times [2023-01-28 11:44:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:44:14,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033535088] [2023-01-28 11:44:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:44:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:44:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:44:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:44:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:44:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033535088] [2023-01-28 11:44:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033535088] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:44:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301707709] [2023-01-28 11:44:15,370 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 11:44:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:44:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:44:15,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:44:15,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 11:44:15,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-01-28 11:44:15,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:44:15,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 11:44:15,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:44:15,542 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 [2023-01-28 11:44:15,589 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 [2023-01-28 11:44:15,627 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 [2023-01-28 11:44:15,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:44:15,847 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 32 treesize of output 32 [2023-01-28 11:44:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:44:15,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:44:16,152 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1)))))) (< c_~front~0 0)) is different from false [2023-01-28 11:44:17,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:17,010 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 126 treesize of output 90 [2023-01-28 11:44:17,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:17,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4130 treesize of output 3732 [2023-01-28 11:44:17,058 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 203 treesize of output 175 [2023-01-28 11:44:17,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:17,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 218 treesize of output 222 [2023-01-28 11:44:17,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:17,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 195 [2023-01-28 11:44:18,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:18,723 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 126 treesize of output 90 [2023-01-28 11:44:18,743 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:44:18,760 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:18,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 626 treesize of output 549 [2023-01-28 11:44:18,786 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:18,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-01-28 11:44:18,806 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:18,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-01-28 11:44:18,910 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 11:44:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 11:44:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301707709] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:44:19,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:44:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2023-01-28 11:44:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077557174] [2023-01-28 11:44:19,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:44:19,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 11:44:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:44:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 11:44:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1322, Unknown=19, NotChecked=76, Total=1640 [2023-01-28 11:44:19,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-01-28 11:44:19,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 1052 transitions, 20605 flow. Second operand has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 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) [2023-01-28 11:44:19,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:44:19,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-01-28 11:44:19,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:44:20,168 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse5 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse3) (select .cse0 .cse4)) 1)) (not (= (select .cse0 .cse5) 1)))))) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse1) 1) 0)) (not (= (select .cse6 .cse5) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse3) (select .cse6 .cse4))))))))))) (< c_~front~0 0))) is different from false [2023-01-28 11:44:22,278 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1)))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 11:44:22,546 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1)))))) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 11:44:22,576 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0) .cse1)))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-28 11:44:23,758 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0)) 1)))) (= (mod c_~v_assert~0 256) 0)) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-28 11:44:23,813 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~back~0 4)) (.cse27 (* c_~front~0 4))) (let ((.cse12 (+ c_~queue~0.offset .cse27)) (.cse17 (+ c_~queue~0.offset .cse28 4)) (.cse26 (select |c_#memory_int| c_~queue~0.base)) (.cse20 (+ c_~queue~0.offset .cse28))) (let ((.cse8 (+ c_~back~0 1)) (.cse19 (+ c_~queue~0.offset .cse27 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse24 (select .cse26 .cse20)) (.cse15 (select .cse26 .cse17)) (.cse23 (select .cse26 .cse12))) (let ((.cse9 (<= 0 c_~sum~0)) (.cse14 (let ((.cse25 (+ c_~sum~0 .cse23))) (and (<= .cse25 1) (<= 0 .cse25)))) (.cse13 (not (= (+ .cse15 1) 0))) (.cse7 (not (= .cse24 1))) (.cse4 (not .cse6)) (.cse5 (not (= (+ .cse24 1) 0))) (.cse1 (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) .cse23) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) .cse23))))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse10 (<= (+ c_~back~0 2) c_~front~0)) (.cse11 (<= c_~n~0 .cse8)) (.cse2 (< c_~front~0 0))) (and (or .cse0 (<= c_~n~0 c_~back~0) .cse1 .cse2 (let ((.cse3 (<= .cse8 c_~front~0))) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse6 .cse7)))) (<= c_~sum~0 0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse9 (<= c_~sum~0 1)) .cse0 .cse10 .cse11 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse12)) 1))) .cse0) (or .cse0 (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) .cse1 .cse2) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) .cse9 (or .cse0 .cse13 .cse10 .cse11 .cse1 .cse2 .cse7) (or .cse14 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or .cse0 .cse14) (or .cse0 (and (or .cse13 .cse6 .cse10 .cse11 .cse7) (or (not (= .cse15 1)) .cse10 .cse4 .cse11 .cse5)) .cse1 .cse2) (or .cse0 .cse10 .cse11 (and (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse16 (select .cse18 c_~queue~0.base))) (or (not (= (+ (select .cse16 .cse17) 1) 0)) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) (select .cse16 .cse12)) 1)) (not (= (select .cse16 .cse20) 1)))))) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse21 (select .cse22 c_~queue~0.base))) (or (not (= (+ (select .cse21 .cse17) 1) 0)) (not (= (select .cse21 .cse20) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) (select .cse21 .cse12))))))))) .cse2)))))) is different from false [2023-01-28 11:44:24,480 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~back~0 4)) (.cse27 (* c_~front~0 4))) (let ((.cse12 (+ c_~queue~0.offset .cse27)) (.cse17 (+ c_~queue~0.offset .cse28 4)) (.cse26 (select |c_#memory_int| c_~queue~0.base)) (.cse20 (+ c_~queue~0.offset .cse28))) (let ((.cse8 (+ c_~back~0 1)) (.cse19 (+ c_~queue~0.offset .cse27 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse24 (select .cse26 .cse20)) (.cse15 (select .cse26 .cse17)) (.cse23 (select .cse26 .cse12))) (let ((.cse9 (<= 0 c_~sum~0)) (.cse14 (let ((.cse25 (+ c_~sum~0 .cse23))) (and (<= .cse25 1) (<= 0 .cse25)))) (.cse13 (not (= (+ .cse15 1) 0))) (.cse7 (not (= .cse24 1))) (.cse4 (not .cse6)) (.cse5 (not (= (+ .cse24 1) 0))) (.cse1 (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) .cse23) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) .cse23))))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse10 (<= (+ c_~back~0 2) c_~front~0)) (.cse11 (<= c_~n~0 .cse8)) (.cse2 (< c_~front~0 0))) (and (or .cse0 (<= c_~n~0 c_~back~0) .cse1 .cse2 (let ((.cse3 (<= .cse8 c_~front~0))) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse6 .cse7)))) (<= c_~sum~0 0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse9 (<= c_~sum~0 1)) .cse0 .cse10 .cse11 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse12)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse12)) 1))) .cse0) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) .cse9 (or .cse0 .cse13 .cse10 .cse11 .cse1 .cse2 .cse7) (or .cse14 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or .cse0 .cse14) (or .cse0 (and (or .cse13 .cse6 .cse10 .cse11 .cse7) (or (not (= .cse15 1)) .cse10 .cse4 .cse11 .cse5)) .cse1 .cse2) (or .cse0 .cse10 .cse11 (and (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse16 (select .cse18 c_~queue~0.base))) (or (not (= (+ (select .cse16 .cse17) 1) 0)) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) (select .cse16 .cse12)) 1)) (not (= (select .cse16 .cse20) 1)))))) (forall ((v_ArrVal_613 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_613))) (let ((.cse21 (select .cse22 c_~queue~0.base))) (or (not (= (+ (select .cse21 .cse17) 1) 0)) (not (= (select .cse21 .cse20) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse19) (select .cse21 .cse12))))))))) .cse2)))))) is different from false [2023-01-28 11:44:24,797 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse0)) 1)))) (= (mod c_~v_assert~0 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-28 11:44:25,712 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~front~0 4))) (let ((.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ c_~queue~0.offset .cse3))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse9 (let ((.cse10 (+ c_~sum~0 .cse2))) (and (<= .cse10 1) (<= 0 .cse10))))) (and (or .cse0 (<= c_~n~0 c_~back~0) (let ((.cse1 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse1) .cse2) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse1) .cse2))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse7 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1)))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse8)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse8)) 1))) .cse0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or .cse9 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or .cse0 .cse9)))))) is different from false [2023-01-28 11:44:25,742 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~front~0 4))) (let ((.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ c_~queue~0.offset .cse3))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse9 (let ((.cse10 (+ c_~sum~0 .cse2))) (and (<= .cse10 1) (<= 0 .cse10))))) (and (or .cse0 (<= c_~n~0 c_~back~0) (let ((.cse1 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse1) .cse2) 1)) (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse1) .cse2))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse7 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1)))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_614 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse8)))) (forall ((v_ArrVal_614 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_614) c_~queue~0.base) .cse8)) 1))) .cse0) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or .cse9 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or .cse0 .cse9)))))) is different from false [2023-01-28 11:44:32,596 INFO L130 PetriNetUnfolder]: 12326/20822 cut-off events. [2023-01-28 11:44:32,596 INFO L131 PetriNetUnfolder]: For 979329/979329 co-relation queries the response was YES. [2023-01-28 11:44:32,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227301 conditions, 20822 events. 12326/20822 cut-off events. For 979329/979329 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 155541 event pairs, 1390 based on Foata normal form. 278/21100 useless extension candidates. Maximal degree in co-relation 227158. Up to 7311 conditions per place. [2023-01-28 11:44:32,923 INFO L137 encePairwiseOnDemand]: 230/246 looper letters, 835 selfloop transitions, 872 changer transitions 506/2213 dead transitions. [2023-01-28 11:44:32,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2213 transitions, 48335 flow [2023-01-28 11:44:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-01-28 11:44:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-01-28 11:44:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 4793 transitions. [2023-01-28 11:44:32,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2823730411217156 [2023-01-28 11:44:32,930 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 4793 transitions. [2023-01-28 11:44:32,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 4793 transitions. [2023-01-28 11:44:32,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:44:32,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 4793 transitions. [2023-01-28 11:44:32,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 69.46376811594203) internal successors, (4793), 69 states have internal predecessors, (4793), 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) [2023-01-28 11:44:32,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 246.0) internal successors, (17220), 70 states have internal predecessors, (17220), 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) [2023-01-28 11:44:32,942 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 246.0) internal successors, (17220), 70 states have internal predecessors, (17220), 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) [2023-01-28 11:44:32,942 INFO L175 Difference]: Start difference. First operand has 469 places, 1052 transitions, 20605 flow. Second operand 69 states and 4793 transitions. [2023-01-28 11:44:32,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 2213 transitions, 48335 flow [2023-01-28 11:44:38,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 2213 transitions, 46173 flow, removed 1022 selfloop flow, removed 18 redundant places. [2023-01-28 11:44:38,830 INFO L231 Difference]: Finished difference. Result has 524 places, 1392 transitions, 30465 flow [2023-01-28 11:44:38,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=18755, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=30465, PETRI_PLACES=524, PETRI_TRANSITIONS=1392} [2023-01-28 11:44:38,831 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 493 predicate places. [2023-01-28 11:44:38,831 INFO L495 AbstractCegarLoop]: Abstraction has has 524 places, 1392 transitions, 30465 flow [2023-01-28 11:44:38,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 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) [2023-01-28 11:44:38,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:44:38,832 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:44:38,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 11:44:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 11:44:39,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:44:39,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:44:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1500609532, now seen corresponding path program 12 times [2023-01-28 11:44:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:44:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394025704] [2023-01-28 11:44:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:44:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:44:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:44:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:44:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:44:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394025704] [2023-01-28 11:44:39,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394025704] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:44:39,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19425914] [2023-01-28 11:44:39,780 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 11:44:39,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:44:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:44:39,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:44:39,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 11:44:39,908 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-28 11:44:39,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:44:39,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-28 11:44:39,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:44:40,003 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 [2023-01-28 11:44:40,056 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 [2023-01-28 11:44:40,095 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 [2023-01-28 11:44:40,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:44:40,387 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 32 treesize of output 32 [2023-01-28 11:44:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:44:40,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:44:40,570 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-01-28 11:44:40,603 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse2)) 1)))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)) is different from false [2023-01-28 11:44:40,660 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0))) is different from false [2023-01-28 11:44:40,698 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0))) is different from false [2023-01-28 11:44:41,053 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~back~0 1))) (or (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse8)) (.cse4 (+ c_~queue~0.offset .cse9 4)) (.cse5 (+ c_~queue~0.offset .cse9)) (.cse2 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_666 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_666))) (let ((.cse0 (select .cse3 c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (not (= 0 (+ (select .cse0 .cse2) 1))) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse4) (select .cse0 .cse5)) 1)))))) (forall ((v_ArrVal_666 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_666))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (select .cse6 .cse1) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse4) (select .cse6 .cse5)))) (not (= 0 (+ (select .cse6 .cse2) 1)))))))))) (= (mod c_~v_assert~0 256) 0) (<= .cse10 c_~front~0) (<= c_~n~0 .cse10) (< c_~front~0 0))) is different from false [2023-01-28 11:44:41,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:41,232 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 126 treesize of output 90 [2023-01-28 11:44:41,259 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 11:44:41,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1098 treesize of output 1007 [2023-01-28 11:44:41,276 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 203 treesize of output 175 [2023-01-28 11:44:41,303 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 11:44:41,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 314 treesize of output 276 [2023-01-28 11:44:41,332 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 11:44:41,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 185 [2023-01-28 11:44:42,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:44:42,196 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 126 treesize of output 90 [2023-01-28 11:44:42,201 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 11:44:42,217 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:42,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 626 treesize of output 549 [2023-01-28 11:44:42,245 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:42,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-01-28 11:44:42,265 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 11:44:42,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-01-28 11:44:42,344 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 11:44:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-01-28 11:44:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19425914] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:44:42,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:44:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2023-01-28 11:44:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301055473] [2023-01-28 11:44:42,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:44:42,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 11:44:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:44:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 11:44:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1077, Unknown=9, NotChecked=360, Total=1640 [2023-01-28 11:44:42,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:44:42,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 1392 transitions, 30465 flow. Second operand has 41 states, 41 states have (on average 63.80487804878049) internal successors, (2616), 41 states have internal predecessors, (2616), 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) [2023-01-28 11:44:42,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:44:42,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:44:42,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:44:43,242 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse10 (+ c_~back~0 1))) (or (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse1 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_666))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ (select .cse0 .cse2) 1) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse0 .cse5)) 1)))))) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_665 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_666))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse6 .cse1) 1)) (not (= (+ (select .cse6 .cse2) 1) 0)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse6 .cse5))))))))))) (= (mod c_~v_assert~0 256) 0) (<= .cse10 c_~front~0) (<= c_~n~0 .cse10) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 11:44:44,623 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0)))) is different from false [2023-01-28 11:44:45,060 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0)))) is different from false [2023-01-28 11:44:45,077 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0))) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) is different from false [2023-01-28 11:44:45,884 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (<= c_~back~0 c_~front~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse3) .cse4)))))) (< c_~front~0 0))) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|)) is different from false [2023-01-28 11:44:46,607 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse2)) 1)))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-28 11:44:52,166 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (forall ((v_ArrVal_667 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse0)))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (forall ((v_ArrVal_667 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_667) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2023-01-28 11:45:03,398 INFO L130 PetriNetUnfolder]: 16910/28280 cut-off events. [2023-01-28 11:45:03,398 INFO L131 PetriNetUnfolder]: For 3575071/3575071 co-relation queries the response was YES. [2023-01-28 11:45:03,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482603 conditions, 28280 events. 16910/28280 cut-off events. For 3575071/3575071 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 218470 event pairs, 2493 based on Foata normal form. 340/28620 useless extension candidates. Maximal degree in co-relation 482426. Up to 11276 conditions per place. [2023-01-28 11:45:03,970 INFO L137 encePairwiseOnDemand]: 230/246 looper letters, 966 selfloop transitions, 1210 changer transitions 371/2547 dead transitions. [2023-01-28 11:45:03,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 2547 transitions, 65644 flow [2023-01-28 11:45:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-01-28 11:45:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-01-28 11:45:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 6038 transitions. [2023-01-28 11:45:03,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2727190605239386 [2023-01-28 11:45:03,976 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 6038 transitions. [2023-01-28 11:45:03,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 6038 transitions. [2023-01-28 11:45:03,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:45:03,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 6038 transitions. [2023-01-28 11:45:03,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 67.08888888888889) internal successors, (6038), 90 states have internal predecessors, (6038), 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) [2023-01-28 11:45:03,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 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) [2023-01-28 11:45:03,994 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 246.0) internal successors, (22386), 91 states have internal predecessors, (22386), 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) [2023-01-28 11:45:03,994 INFO L175 Difference]: Start difference. First operand has 524 places, 1392 transitions, 30465 flow. Second operand 90 states and 6038 transitions. [2023-01-28 11:45:03,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 2547 transitions, 65644 flow [2023-01-28 11:45:19,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 2547 transitions, 61793 flow, removed 1810 selfloop flow, removed 24 redundant places. [2023-01-28 11:45:19,713 INFO L231 Difference]: Finished difference. Result has 631 places, 1813 transitions, 43705 flow [2023-01-28 11:45:19,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=27249, PETRI_DIFFERENCE_MINUEND_PLACES=488, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=685, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=43705, PETRI_PLACES=631, PETRI_TRANSITIONS=1813} [2023-01-28 11:45:19,714 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 600 predicate places. [2023-01-28 11:45:19,714 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 1813 transitions, 43705 flow [2023-01-28 11:45:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 63.80487804878049) internal successors, (2616), 41 states have internal predecessors, (2616), 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) [2023-01-28 11:45:19,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:45:19,714 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:45:19,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-28 11:45:19,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 11:45:19,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:45:19,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:45:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 584080337, now seen corresponding path program 13 times [2023-01-28 11:45:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:45:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105522448] [2023-01-28 11:45:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:45:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:45:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:45:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:45:20,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:45:20,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105522448] [2023-01-28 11:45:20,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105522448] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:45:20,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443695718] [2023-01-28 11:45:20,958 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 11:45:20,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:45:20,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:45:20,959 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:45:20,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 11:45:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:45:21,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 11:45:21,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:45:21,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:45:21,331 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 32 treesize of output 32 [2023-01-28 11:45:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:45:21,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:45:21,586 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_720 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_720 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:45:21,620 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_720 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_720 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:45:21,747 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 11:45:21,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 236 [2023-01-28 11:45:21,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:45:21,759 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 71 treesize of output 58 [2023-01-28 11:45:21,770 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:45:21,771 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 58 treesize of output 45 [2023-01-28 11:45:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-01-28 11:45:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443695718] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:45:22,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:45:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 35 [2023-01-28 11:45:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634947345] [2023-01-28 11:45:22,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:45:22,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-28 11:45:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:45:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-28 11:45:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=969, Unknown=2, NotChecked=130, Total=1260 [2023-01-28 11:45:22,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-01-28 11:45:22,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 1813 transitions, 43705 flow. Second operand has 36 states, 36 states have (on average 71.91666666666667) internal successors, (2589), 36 states have internal predecessors, (2589), 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) [2023-01-28 11:45:22,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:45:22,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-01-28 11:45:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:45:23,324 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_720 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_720 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 11:45:23,541 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_720 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_720 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_720) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 11:45:56,757 INFO L130 PetriNetUnfolder]: 20657/34249 cut-off events. [2023-01-28 11:45:56,757 INFO L131 PetriNetUnfolder]: For 8011952/8011952 co-relation queries the response was YES. [2023-01-28 11:45:57,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755217 conditions, 34249 events. 20657/34249 cut-off events. For 8011952/8011952 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 268627 event pairs, 1743 based on Foata normal form. 96/34345 useless extension candidates. Maximal degree in co-relation 754996. Up to 14004 conditions per place. [2023-01-28 11:45:57,689 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 1417 selfloop transitions, 1386 changer transitions 293/3096 dead transitions. [2023-01-28 11:45:57,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 3096 transitions, 85313 flow [2023-01-28 11:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-28 11:45:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-01-28 11:45:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 4795 transitions. [2023-01-28 11:45:57,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3093947606142728 [2023-01-28 11:45:57,693 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 4795 transitions. [2023-01-28 11:45:57,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 4795 transitions. [2023-01-28 11:45:57,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:45:57,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 4795 transitions. [2023-01-28 11:45:57,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 76.11111111111111) internal successors, (4795), 63 states have internal predecessors, (4795), 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) [2023-01-28 11:45:57,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 246.0) internal successors, (15744), 64 states have internal predecessors, (15744), 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) [2023-01-28 11:45:57,704 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 246.0) internal successors, (15744), 64 states have internal predecessors, (15744), 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) [2023-01-28 11:45:57,704 INFO L175 Difference]: Start difference. First operand has 631 places, 1813 transitions, 43705 flow. Second operand 63 states and 4795 transitions. [2023-01-28 11:45:57,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 3096 transitions, 85313 flow [2023-01-28 11:46:23,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 3096 transitions, 80987 flow, removed 1868 selfloop flow, removed 51 redundant places. [2023-01-28 11:46:23,837 INFO L231 Difference]: Finished difference. Result has 653 places, 2305 transitions, 58249 flow [2023-01-28 11:46:23,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=40786, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=925, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=58249, PETRI_PLACES=653, PETRI_TRANSITIONS=2305} [2023-01-28 11:46:23,838 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 622 predicate places. [2023-01-28 11:46:23,838 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 2305 transitions, 58249 flow [2023-01-28 11:46:23,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 71.91666666666667) internal successors, (2589), 36 states have internal predecessors, (2589), 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) [2023-01-28 11:46:23,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:46:23,839 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:46:23,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 11:46:24,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 11:46:24,043 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:46:24,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:46:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1287943941, now seen corresponding path program 14 times [2023-01-28 11:46:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:46:24,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152417772] [2023-01-28 11:46:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:46:24,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:46:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:46:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:46:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:46:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152417772] [2023-01-28 11:46:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152417772] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:46:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939985014] [2023-01-28 11:46:25,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 11:46:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:46:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:46:25,408 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:46:25,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 11:46:25,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 11:46:25,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:46:25,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 11:46:25,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:46:25,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:46:25,716 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 19 treesize of output 21 [2023-01-28 11:46:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 11:46:25,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:46:26,171 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4)) (.cse4 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse4)) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset .cse9))) (and (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))))) .cse4) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (select .cse8 .cse1) 1)) (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1)))) .cse4)))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) is different from false [2023-01-28 11:46:26,209 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4)) (.cse4 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse4)) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset .cse9))) (and (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))))) .cse4) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_773) c_~queue~0.base))) (or (not (= (select .cse8 .cse1) 1)) (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1)))) .cse4)))) (= (mod c_~v_assert~0 256) 0)) is different from false [2023-01-28 11:46:26,319 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 11:46:26,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 504 treesize of output 408 [2023-01-28 11:46:26,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:46:26,338 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 267 treesize of output 267 [2023-01-28 11:46:26,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:46:26,356 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 248 treesize of output 248 [2023-01-28 11:46:26,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:46:26,376 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 229 treesize of output 229 [2023-01-28 11:46:26,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 11:46:26,399 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 210 treesize of output 210 [2023-01-28 11:46:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-01-28 11:46:27,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939985014] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:46:27,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:46:27,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-01-28 11:46:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434614000] [2023-01-28 11:46:27,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:46:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 11:46:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:46:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 11:46:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1032, Unknown=2, NotChecked=134, Total=1332 [2023-01-28 11:46:27,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-01-28 11:46:27,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 2305 transitions, 58249 flow. Second operand has 37 states, 37 states have (on average 65.94594594594595) internal successors, (2440), 37 states have internal predecessors, (2440), 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) [2023-01-28 11:46:27,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:46:27,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-01-28 11:46:27,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:46:33,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:46:39,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 11:47:13,744 INFO L130 PetriNetUnfolder]: 30321/50401 cut-off events. [2023-01-28 11:47:13,744 INFO L131 PetriNetUnfolder]: For 13138433/13138433 co-relation queries the response was YES. [2023-01-28 11:47:14,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182149 conditions, 50401 events. 30321/50401 cut-off events. For 13138433/13138433 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 415801 event pairs, 1561 based on Foata normal form. 495/50896 useless extension candidates. Maximal degree in co-relation 1181921. Up to 19317 conditions per place. [2023-01-28 11:47:15,470 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 1731 selfloop transitions, 1792 changer transitions 587/4110 dead transitions. [2023-01-28 11:47:15,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 4110 transitions, 119314 flow [2023-01-28 11:47:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-28 11:47:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-01-28 11:47:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3205 transitions. [2023-01-28 11:47:15,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2895212285456188 [2023-01-28 11:47:15,474 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3205 transitions. [2023-01-28 11:47:15,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3205 transitions. [2023-01-28 11:47:15,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:47:15,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3205 transitions. [2023-01-28 11:47:15,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 71.22222222222223) internal successors, (3205), 45 states have internal predecessors, (3205), 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) [2023-01-28 11:47:15,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 246.0) internal successors, (11316), 46 states have internal predecessors, (11316), 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) [2023-01-28 11:47:15,482 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 246.0) internal successors, (11316), 46 states have internal predecessors, (11316), 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) [2023-01-28 11:47:15,482 INFO L175 Difference]: Start difference. First operand has 653 places, 2305 transitions, 58249 flow. Second operand 45 states and 3205 transitions. [2023-01-28 11:47:15,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 4110 transitions, 119314 flow [2023-01-28 11:48:08,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 4110 transitions, 115152 flow, removed 1903 selfloop flow, removed 9 redundant places. [2023-01-28 11:48:08,937 INFO L231 Difference]: Finished difference. Result has 699 places, 2867 transitions, 77712 flow [2023-01-28 11:48:08,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=55332, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=77712, PETRI_PLACES=699, PETRI_TRANSITIONS=2867} [2023-01-28 11:48:08,939 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 668 predicate places. [2023-01-28 11:48:08,939 INFO L495 AbstractCegarLoop]: Abstraction has has 699 places, 2867 transitions, 77712 flow [2023-01-28 11:48:08,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 65.94594594594595) internal successors, (2440), 37 states have internal predecessors, (2440), 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) [2023-01-28 11:48:08,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:48:08,940 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:48:08,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 11:48:09,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:48:09,141 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:48:09,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:48:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -139258841, now seen corresponding path program 15 times [2023-01-28 11:48:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:48:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814313557] [2023-01-28 11:48:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:48:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:48:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:48:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:48:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:48:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814313557] [2023-01-28 11:48:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814313557] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:48:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374571480] [2023-01-28 11:48:10,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 11:48:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:48:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:48:10,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:48:10,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 11:48:10,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-28 11:48:10,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:48:10,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-28 11:48:10,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:48:10,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:48:10,992 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 32 treesize of output 32 [2023-01-28 11:48:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:48:11,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:48:11,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse0)))))) is different from false [2023-01-28 11:48:11,209 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) is different from false [2023-01-28 11:48:11,246 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2023-01-28 11:48:11,454 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 11:48:11,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 224 [2023-01-28 11:48:11,465 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 59 treesize of output 52 [2023-01-28 11:48:11,473 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 52 treesize of output 45 [2023-01-28 11:48:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2023-01-28 11:48:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374571480] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:48:11,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:48:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-01-28 11:48:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624731263] [2023-01-28 11:48:11,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:48:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 11:48:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:48:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 11:48:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=977, Unknown=9, NotChecked=198, Total=1332 [2023-01-28 11:48:11,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:48:11,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 2867 transitions, 77712 flow. Second operand has 37 states, 37 states have (on average 64.16216216216216) internal successors, (2374), 37 states have internal predecessors, (2374), 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) [2023-01-28 11:48:11,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:48:11,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:48:11,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:48:15,232 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-28 11:48:15,865 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|)) is different from false [2023-01-28 11:48:17,676 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse2)))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-01-28 11:48:17,711 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse0)) 1)) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (forall ((v_ArrVal_826 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_826) c_~queue~0.base) .cse0)))))) is different from false [2023-01-28 11:49:21,086 INFO L130 PetriNetUnfolder]: 47809/78502 cut-off events. [2023-01-28 11:49:21,086 INFO L131 PetriNetUnfolder]: For 23149034/23149034 co-relation queries the response was YES. [2023-01-28 11:49:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1994495 conditions, 78502 events. 47809/78502 cut-off events. For 23149034/23149034 co-relation queries the response was YES. Maximal size of possible extension queue 2841. Compared 685430 event pairs, 4061 based on Foata normal form. 1114/79616 useless extension candidates. Maximal degree in co-relation 1994254. Up to 32362 conditions per place. [2023-01-28 11:49:24,560 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 2955 selfloop transitions, 2391 changer transitions 799/6145 dead transitions. [2023-01-28 11:49:24,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 6145 transitions, 193015 flow [2023-01-28 11:49:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-01-28 11:49:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-01-28 11:49:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 3919 transitions. [2023-01-28 11:49:24,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27467059153350154 [2023-01-28 11:49:24,564 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 3919 transitions. [2023-01-28 11:49:24,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 3919 transitions. [2023-01-28 11:49:24,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 11:49:24,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 3919 transitions. [2023-01-28 11:49:24,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 67.56896551724138) internal successors, (3919), 58 states have internal predecessors, (3919), 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) [2023-01-28 11:49:24,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 246.0) internal successors, (14514), 59 states have internal predecessors, (14514), 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) [2023-01-28 11:49:24,574 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 246.0) internal successors, (14514), 59 states have internal predecessors, (14514), 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) [2023-01-28 11:49:24,574 INFO L175 Difference]: Start difference. First operand has 699 places, 2867 transitions, 77712 flow. Second operand 58 states and 3919 transitions. [2023-01-28 11:49:24,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 756 places, 6145 transitions, 193015 flow [2023-01-28 11:52:20,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 743 places, 6145 transitions, 183496 flow, removed 4504 selfloop flow, removed 13 redundant places. [2023-01-28 11:52:20,296 INFO L231 Difference]: Finished difference. Result has 772 places, 4190 transitions, 121805 flow [2023-01-28 11:52:20,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=73712, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=121805, PETRI_PLACES=772, PETRI_TRANSITIONS=4190} [2023-01-28 11:52:20,298 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 741 predicate places. [2023-01-28 11:52:20,298 INFO L495 AbstractCegarLoop]: Abstraction has has 772 places, 4190 transitions, 121805 flow [2023-01-28 11:52:20,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 64.16216216216216) internal successors, (2374), 37 states have internal predecessors, (2374), 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) [2023-01-28 11:52:20,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 11:52:20,299 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 11:52:20,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 11:52:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:52:20,499 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 11:52:20,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 11:52:20,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1597888719, now seen corresponding path program 16 times [2023-01-28 11:52:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 11:52:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411660574] [2023-01-28 11:52:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 11:52:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 11:52:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 11:52:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 11:52:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 11:52:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411660574] [2023-01-28 11:52:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411660574] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 11:52:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811790684] [2023-01-28 11:52:21,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 11:52:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 11:52:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 11:52:21,902 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 11:52:21,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 11:52:21,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 11:52:21,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 11:52:21,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 11:52:22,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 11:52:22,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 11:52:22,294 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 32 treesize of output 32 [2023-01-28 11:52:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 11:52:22,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 11:52:22,525 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse1))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 11:52:22,551 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) is different from false [2023-01-28 11:52:22,659 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 11:52:22,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 224 [2023-01-28 11:52:22,667 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 59 treesize of output 52 [2023-01-28 11:52:22,674 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 52 treesize of output 45 [2023-01-28 11:52:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2023-01-28 11:52:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811790684] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 11:52:23,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 11:52:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-01-28 11:52:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840510158] [2023-01-28 11:52:23,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 11:52:23,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 11:52:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 11:52:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 11:52:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1036, Unknown=9, NotChecked=134, Total=1332 [2023-01-28 11:52:23,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 11:52:23,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 4190 transitions, 121805 flow. Second operand has 37 states, 37 states have (on average 63.86486486486486) internal successors, (2363), 37 states have internal predecessors, (2363), 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) [2023-01-28 11:52:23,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 11:52:23,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 11:52:23,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 11:52:25,254 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-01-28 11:52:26,202 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-01-28 11:52:27,429 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~v_assert~0 1) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse0)))) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse0)) 1)) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|))) is different from false [2023-01-28 11:53:17,087 WARN L839 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-28 11:53:41,963 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse1))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256))) is different from false [2023-01-28 11:53:56,946 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_879 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_879 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_879) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false Received shutdown request... [2023-01-28 11:54:14,118 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 11:54:14,158 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 [2023-01-28 11:54:15,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 11:54:15,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-01-28 11:54:17,981 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 11:54:17,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-01-28 11:54:17,982 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-28 11:54:17,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 11:54:17,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 11:54:17,983 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 11:54:17,983 INFO L445 BasicCegarLoop]: Path program histogram: [16, 3, 1, 1] [2023-01-28 11:54:17,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 11:54:17,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 11:54:17,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:54:17 BasicIcfg [2023-01-28 11:54:17,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 11:54:17,987 INFO L158 Benchmark]: Toolchain (without parser) took 798290.11ms. Allocated memory was 371.2MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 339.9MB in the beginning and 9.0GB in the end (delta: -8.6GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.92ms. Allocated memory is still 371.2MB. Free memory was 339.5MB in the beginning and 327.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.40ms. Allocated memory is still 371.2MB. Free memory was 327.7MB in the beginning and 325.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: Boogie Preprocessor took 18.05ms. Allocated memory is still 371.2MB. Free memory was 325.6MB in the beginning and 323.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: RCFGBuilder took 462.30ms. Allocated memory is still 371.2MB. Free memory was 323.9MB in the beginning and 301.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 11:54:17,987 INFO L158 Benchmark]: TraceAbstraction took 797581.65ms. Allocated memory was 371.2MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 300.9MB in the beginning and 9.0GB in the end (delta: -8.7GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-01-28 11:54:17,988 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 199.92ms. Allocated memory is still 371.2MB. Free memory was 339.5MB in the beginning and 327.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.40ms. Allocated memory is still 371.2MB. Free memory was 327.7MB in the beginning and 325.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.05ms. Allocated memory is still 371.2MB. Free memory was 325.6MB in the beginning and 323.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 462.30ms. Allocated memory is still 371.2MB. Free memory was 323.9MB in the beginning and 301.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 797581.65ms. Allocated memory was 371.2MB in the beginning and 14.2GB in the end (delta: 13.9GB). Free memory was 300.9MB in the beginning and 9.0GB in the end (delta: -8.7GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 122 PlacesBefore, 31 PlacesAfterwards, 122 TransitionsBefore, 24 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 7 ChoiceCompositions, 111 TotalNumberOfCompositions, 2055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1573, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 696, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1573, independent: 841, independent conditional: 0, independent unconditional: 841, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 696, unknown conditional: 0, unknown unconditional: 696] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - 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 executing Executor. - 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 executing Executor. - 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 executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 797.5s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 637.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 378 mSolverCounterUnknown, 7729 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7729 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16724 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 696 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20688 IncrementalHoareTripleChecker+Invalid, 38486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 696 mSolverCounterUnsat, 10 mSDtfsCounter, 20688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1796 GetRequests, 501 SyntacticMatches, 75 SemanticMatches, 1220 ConstructedPredicates, 65 IntricatePredicates, 0 DeprecatedPredicates, 31119 ImplicationChecksByTransitivity, 74.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121805occurred in iteration=20, InterpolantAutomatonStates: 842, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 151.3s InterpolantComputationTime, 954 NumberOfCodeBlocks, 954 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1316 ConstructedInterpolants, 72 QuantifiedInterpolants, 29034 SizeOfPredicates, 382 NumberOfNonLiveVariables, 3645 ConjunctsInSsa, 613 ConjunctsInUnsatCore, 51 InterpolantComputations, 6 PerfectInterpolantSequences, 121/419 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 !ENTRY org.eclipse.osgi 4 0 2023-01-28 11:54:17.999 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a2c3ba74/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438)