/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:42:26,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:42:26,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:42:26,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:42:26,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:42:26,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:42:26,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:42:26,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:42:26,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:42:26,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:42:26,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:42:26,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:42:26,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:42:26,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:42:26,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:42:26,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:42:26,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:42:26,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:42:26,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:42:26,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:42:26,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:42:26,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:42:26,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:42:26,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:42:26,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:42:26,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:42:26,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:42:26,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:42:26,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:42:26,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:42:26,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:42:26,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:42:26,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:42:26,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:42:26,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:42:26,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:42:26,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:42:26,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:42:26,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:42:26,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:42:26,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:42:26,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-05 19:42:26,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:42:26,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:42:26,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:42:26,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:42:26,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:42:26,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:42:26,310 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:42:26,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:42:26,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:42:26,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:42:26,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:42:26,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:42:26,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:42:26,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:42:26,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 19:42:26,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:42:26,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:42:26,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:42:26,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:42:26,607 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:42:26,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-12-05 19:42:27,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:42:28,010 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:42:28,011 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2022-12-05 19:42:28,016 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47071d23d/47cf74e65e6c46cdbe8dc38ec907875a/FLAG5a1c341a1 [2022-12-05 19:42:28,028 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47071d23d/47cf74e65e6c46cdbe8dc38ec907875a [2022-12-05 19:42:28,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:42:28,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:42:28,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:42:28,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:42:28,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:42:28,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcc9242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28, skipping insertion in model container [2022-12-05 19:42:28,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:42:28,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:42:28,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-12-05 19:42:28,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:42:28,205 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:42:28,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:42:28,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:42:28,226 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-12-05 19:42:28,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:42:28,242 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:42:28,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28 WrapperNode [2022-12-05 19:42:28,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:42:28,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:42:28,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:42:28,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:42:28,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,307 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 150 [2022-12-05 19:42:28,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:42:28,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:42:28,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:42:28,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:42:28,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,342 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:42:28,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:42:28,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:42:28,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:42:28,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (1/1) ... [2022-12-05 19:42:28,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:42:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:42:28,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 19:42:28,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 19:42:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:42:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:42:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:42:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:42:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:42:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:42:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:42:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:42:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 19:42:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 19:42:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:42:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 19:42:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 19:42:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:42:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:42:28,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:42:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:42:28,432 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:42:28,587 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:42:28,589 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:42:28,933 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:42:28,972 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:42:28,972 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-05 19:42:28,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:42:28 BoogieIcfgContainer [2022-12-05 19:42:28,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:42:28,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:42:28,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:42:28,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:42:28,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:42:28" (1/3) ... [2022-12-05 19:42:28,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:42:28, skipping insertion in model container [2022-12-05 19:42:28,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:42:28" (2/3) ... [2022-12-05 19:42:28,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:42:28, skipping insertion in model container [2022-12-05 19:42:28,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:42:28" (3/3) ... [2022-12-05 19:42:28,982 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-12-05 19:42:29,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:42:29,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:42:29,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:42:29,084 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-05 19:42:29,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 208 transitions, 440 flow [2022-12-05 19:42:29,204 INFO L130 PetriNetUnfolder]: 20/205 cut-off events. [2022-12-05 19:42:29,204 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:42:29,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 20/205 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 166. Up to 3 conditions per place. [2022-12-05 19:42:29,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 208 transitions, 440 flow [2022-12-05 19:42:29,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 195 transitions, 408 flow [2022-12-05 19:42:29,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:42:29,232 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;@2f64fae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:42:29,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 19:42:29,278 INFO L130 PetriNetUnfolder]: 20/194 cut-off events. [2022-12-05 19:42:29,278 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 19:42:29,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:29,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:29,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2009908469, now seen corresponding path program 1 times [2022-12-05 19:42:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480230195] [2022-12-05 19:42:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:42:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480230195] [2022-12-05 19:42:30,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480230195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:42:30,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:42:30,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:42:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056656299] [2022-12-05 19:42:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:30,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:42:30,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 208 [2022-12-05 19:42:30,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 195 transitions, 408 flow. Second operand has 7 states, 7 states have (on average 151.28571428571428) internal successors, (1059), 7 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:30,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:30,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 208 [2022-12-05 19:42:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:30,846 INFO L130 PetriNetUnfolder]: 70/440 cut-off events. [2022-12-05 19:42:30,846 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-05 19:42:30,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 440 events. 70/440 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1495 event pairs, 17 based on Foata normal form. 66/458 useless extension candidates. Maximal degree in co-relation 279. Up to 62 conditions per place. [2022-12-05 19:42:30,855 INFO L137 encePairwiseOnDemand]: 180/208 looper letters, 52 selfloop transitions, 6 changer transitions 13/205 dead transitions. [2022-12-05 19:42:30,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 205 transitions, 594 flow [2022-12-05 19:42:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-05 19:42:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-05 19:42:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1553 transitions. [2022-12-05 19:42:30,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7466346153846154 [2022-12-05 19:42:30,879 INFO L175 Difference]: Start difference. First operand has 185 places, 195 transitions, 408 flow. Second operand 10 states and 1553 transitions. [2022-12-05 19:42:30,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 205 transitions, 594 flow [2022-12-05 19:42:30,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 205 transitions, 566 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 19:42:30,890 INFO L231 Difference]: Finished difference. Result has 191 places, 178 transitions, 387 flow [2022-12-05 19:42:30,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=178} [2022-12-05 19:42:30,896 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 6 predicate places. [2022-12-05 19:42:30,896 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 178 transitions, 387 flow [2022-12-05 19:42:30,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 151.28571428571428) internal successors, (1059), 7 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:30,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:30,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:30,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:42:30,898 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1751824694, now seen corresponding path program 1 times [2022-12-05 19:42:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738313630] [2022-12-05 19:42:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:42:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:31,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738313630] [2022-12-05 19:42:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738313630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:42:31,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:42:31,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:42:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898378962] [2022-12-05 19:42:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:31,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:42:31,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 208 [2022-12-05 19:42:31,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 178 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 143.85714285714286) internal successors, (1007), 7 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:31,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:31,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 208 [2022-12-05 19:42:31,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:31,819 INFO L130 PetriNetUnfolder]: 1164/2707 cut-off events. [2022-12-05 19:42:31,819 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-05 19:42:31,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 2707 events. 1164/2707 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 17619 event pairs, 581 based on Foata normal form. 0/2048 useless extension candidates. Maximal degree in co-relation 4641. Up to 1051 conditions per place. [2022-12-05 19:42:31,841 INFO L137 encePairwiseOnDemand]: 189/208 looper letters, 120 selfloop transitions, 28 changer transitions 0/269 dead transitions. [2022-12-05 19:42:31,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 269 transitions, 881 flow [2022-12-05 19:42:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 19:42:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 19:42:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1667 transitions. [2022-12-05 19:42:31,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.728583916083916 [2022-12-05 19:42:31,847 INFO L175 Difference]: Start difference. First operand has 191 places, 178 transitions, 387 flow. Second operand 11 states and 1667 transitions. [2022-12-05 19:42:31,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 269 transitions, 881 flow [2022-12-05 19:42:31,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 269 transitions, 875 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 19:42:31,856 INFO L231 Difference]: Finished difference. Result has 190 places, 195 transitions, 514 flow [2022-12-05 19:42:31,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=190, PETRI_TRANSITIONS=195} [2022-12-05 19:42:31,858 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 5 predicate places. [2022-12-05 19:42:31,858 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 195 transitions, 514 flow [2022-12-05 19:42:31,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 143.85714285714286) internal successors, (1007), 7 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:31,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:31,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:31,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 19:42:31,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1110870131, now seen corresponding path program 1 times [2022-12-05 19:42:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:31,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408698404] [2022-12-05 19:42:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:31,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:42:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:32,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408698404] [2022-12-05 19:42:32,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408698404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:42:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:42:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 19:42:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77402706] [2022-12-05 19:42:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:32,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:42:32,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 208 [2022-12-05 19:42:32,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 195 transitions, 514 flow. Second operand has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:32,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:32,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 208 [2022-12-05 19:42:32,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:32,631 INFO L130 PetriNetUnfolder]: 897/2264 cut-off events. [2022-12-05 19:42:32,631 INFO L131 PetriNetUnfolder]: For 585/620 co-relation queries the response was YES. [2022-12-05 19:42:32,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4188 conditions, 2264 events. 897/2264 cut-off events. For 585/620 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13762 event pairs, 516 based on Foata normal form. 29/1940 useless extension candidates. Maximal degree in co-relation 3314. Up to 1093 conditions per place. [2022-12-05 19:42:32,645 INFO L137 encePairwiseOnDemand]: 189/208 looper letters, 56 selfloop transitions, 14 changer transitions 77/267 dead transitions. [2022-12-05 19:42:32,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 267 transitions, 980 flow [2022-12-05 19:42:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 19:42:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 19:42:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1653 transitions. [2022-12-05 19:42:32,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.722465034965035 [2022-12-05 19:42:32,651 INFO L175 Difference]: Start difference. First operand has 190 places, 195 transitions, 514 flow. Second operand 11 states and 1653 transitions. [2022-12-05 19:42:32,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 267 transitions, 980 flow [2022-12-05 19:42:32,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 267 transitions, 975 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 19:42:32,662 INFO L231 Difference]: Finished difference. Result has 202 places, 181 transitions, 474 flow [2022-12-05 19:42:32,663 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=474, PETRI_PLACES=202, PETRI_TRANSITIONS=181} [2022-12-05 19:42:32,664 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 17 predicate places. [2022-12-05 19:42:32,664 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 181 transitions, 474 flow [2022-12-05 19:42:32,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:32,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:32,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:32,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:42:32,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:32,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -105076185, now seen corresponding path program 1 times [2022-12-05 19:42:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:32,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438219822] [2022-12-05 19:42:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438219822] [2022-12-05 19:42:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438219822] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256623788] [2022-12-05 19:42:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:32,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:42:32,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:42:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:42:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:33,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:42:33,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:42:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:33,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:42:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:33,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256623788] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:33,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:42:33,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-05 19:42:33,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958773562] [2022-12-05 19:42:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:33,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:42:33,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 208 [2022-12-05 19:42:33,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 181 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:33,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:33,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 208 [2022-12-05 19:42:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:33,834 INFO L130 PetriNetUnfolder]: 635/1491 cut-off events. [2022-12-05 19:42:33,834 INFO L131 PetriNetUnfolder]: For 625/625 co-relation queries the response was YES. [2022-12-05 19:42:33,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 1491 events. 635/1491 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8364 event pairs, 273 based on Foata normal form. 29/1287 useless extension candidates. Maximal degree in co-relation 2950. Up to 603 conditions per place. [2022-12-05 19:42:33,849 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 65 selfloop transitions, 7 changer transitions 0/192 dead transitions. [2022-12-05 19:42:33,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 192 transitions, 655 flow [2022-12-05 19:42:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:42:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:42:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1027 transitions. [2022-12-05 19:42:33,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2022-12-05 19:42:33,852 INFO L175 Difference]: Start difference. First operand has 202 places, 181 transitions, 474 flow. Second operand 7 states and 1027 transitions. [2022-12-05 19:42:33,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 192 transitions, 655 flow [2022-12-05 19:42:33,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 192 transitions, 582 flow, removed 14 selfloop flow, removed 14 redundant places. [2022-12-05 19:42:33,860 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 442 flow [2022-12-05 19:42:33,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-12-05 19:42:33,862 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 2 predicate places. [2022-12-05 19:42:33,862 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 442 flow [2022-12-05 19:42:33,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:33,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:33,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:33,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 19:42:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:34,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1859231518, now seen corresponding path program 1 times [2022-12-05 19:42:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29585340] [2022-12-05 19:42:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:34,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29585340] [2022-12-05 19:42:34,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29585340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:34,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459738239] [2022-12-05 19:42:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:34,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:34,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:42:34,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:42:34,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 19:42:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:34,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:42:34,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:42:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:34,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:42:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459738239] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:34,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:42:34,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-05 19:42:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399692266] [2022-12-05 19:42:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:34,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:42:34,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 208 [2022-12-05 19:42:34,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:34,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:34,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 208 [2022-12-05 19:42:34,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:35,001 INFO L130 PetriNetUnfolder]: 470/1224 cut-off events. [2022-12-05 19:42:35,002 INFO L131 PetriNetUnfolder]: For 356/488 co-relation queries the response was YES. [2022-12-05 19:42:35,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 1224 events. 470/1224 cut-off events. For 356/488 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7061 event pairs, 179 based on Foata normal form. 132/1150 useless extension candidates. Maximal degree in co-relation 2201. Up to 377 conditions per place. [2022-12-05 19:42:35,011 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 64 selfloop transitions, 7 changer transitions 0/193 dead transitions. [2022-12-05 19:42:35,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 619 flow [2022-12-05 19:42:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:42:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:42:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1038 transitions. [2022-12-05 19:42:35,014 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7129120879120879 [2022-12-05 19:42:35,014 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 442 flow. Second operand 7 states and 1038 transitions. [2022-12-05 19:42:35,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 619 flow [2022-12-05 19:42:35,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 610 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:42:35,018 INFO L231 Difference]: Finished difference. Result has 191 places, 184 transitions, 461 flow [2022-12-05 19:42:35,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=461, PETRI_PLACES=191, PETRI_TRANSITIONS=184} [2022-12-05 19:42:35,019 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 6 predicate places. [2022-12-05 19:42:35,020 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 184 transitions, 461 flow [2022-12-05 19:42:35,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:35,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:35,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:35,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-05 19:42:35,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:35,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1615622818, now seen corresponding path program 1 times [2022-12-05 19:42:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176835078] [2022-12-05 19:42:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:42:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:35,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176835078] [2022-12-05 19:42:35,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176835078] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:35,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680006844] [2022-12-05 19:42:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:42:35,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:42:35,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 19:42:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:35,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 19:42:35,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:42:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:42:35,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:42:35,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-05 19:42:35,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680006844] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:35,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 19:42:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-05 19:42:35,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38877426] [2022-12-05 19:42:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:42:35,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:42:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:42:35,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:42:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-05 19:42:35,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 208 [2022-12-05 19:42:35,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 184 transitions, 461 flow. Second operand has 7 states, 7 states have (on average 145.28571428571428) internal successors, (1017), 7 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:35,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:42:35,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 208 [2022-12-05 19:42:35,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:42:36,180 INFO L130 PetriNetUnfolder]: 440/1030 cut-off events. [2022-12-05 19:42:36,181 INFO L131 PetriNetUnfolder]: For 596/849 co-relation queries the response was YES. [2022-12-05 19:42:36,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 1030 events. 440/1030 cut-off events. For 596/849 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5245 event pairs, 109 based on Foata normal form. 253/1174 useless extension candidates. Maximal degree in co-relation 2129. Up to 415 conditions per place. [2022-12-05 19:42:36,188 INFO L137 encePairwiseOnDemand]: 200/208 looper letters, 66 selfloop transitions, 7 changer transitions 0/194 dead transitions. [2022-12-05 19:42:36,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 194 transitions, 644 flow [2022-12-05 19:42:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:42:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:42:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1032 transitions. [2022-12-05 19:42:36,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7087912087912088 [2022-12-05 19:42:36,191 INFO L175 Difference]: Start difference. First operand has 191 places, 184 transitions, 461 flow. Second operand 7 states and 1032 transitions. [2022-12-05 19:42:36,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 194 transitions, 644 flow [2022-12-05 19:42:36,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 194 transitions, 633 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-05 19:42:36,195 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 478 flow [2022-12-05 19:42:36,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=478, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2022-12-05 19:42:36,196 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 9 predicate places. [2022-12-05 19:42:36,196 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 478 flow [2022-12-05 19:42:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 145.28571428571428) internal successors, (1017), 7 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:42:36,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:42:36,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:42:36,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 19:42:36,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:36,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:42:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:42:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -218677697, now seen corresponding path program 1 times [2022-12-05 19:42:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:42:36,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906095346] [2022-12-05 19:42:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:36,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:42:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:42:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:42:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906095346] [2022-12-05 19:42:39,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906095346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:42:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822601126] [2022-12-05 19:42:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:42:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:42:39,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:42:39,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:42:39,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 19:42:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:42:39,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-05 19:42:39,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:42:40,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:42:40,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-05 19:42:40,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 19:42:40,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-05 19:42:41,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:42:41,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:42:41,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:42:41,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:42:42,079 INFO L321 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-12-05 19:42:42,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2022-12-05 19:42:43,163 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:42:43,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 172 [2022-12-05 19:42:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:42:43,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:43:28,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-05 19:43:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:43:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822601126] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:43:28,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:43:28,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36, 16] total 73 [2022-12-05 19:43:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133467099] [2022-12-05 19:43:28,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:43:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-05 19:43:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:43:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-05 19:43:28,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=4656, Unknown=17, NotChecked=0, Total=5256 [2022-12-05 19:43:28,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 208 [2022-12-05 19:43:28,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 478 flow. Second operand has 73 states, 73 states have (on average 60.68493150684932) internal successors, (4430), 73 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:43:28,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:43:28,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 208 [2022-12-05 19:43:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:43:36,218 INFO L130 PetriNetUnfolder]: 10380/16993 cut-off events. [2022-12-05 19:43:36,218 INFO L131 PetriNetUnfolder]: For 11484/11484 co-relation queries the response was YES. [2022-12-05 19:43:36,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41446 conditions, 16993 events. 10380/16993 cut-off events. For 11484/11484 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 122685 event pairs, 485 based on Foata normal form. 1/16416 useless extension candidates. Maximal degree in co-relation 41339. Up to 5865 conditions per place. [2022-12-05 19:43:36,358 INFO L137 encePairwiseOnDemand]: 156/208 looper letters, 351 selfloop transitions, 104 changer transitions 4/509 dead transitions. [2022-12-05 19:43:36,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 509 transitions, 2478 flow [2022-12-05 19:43:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-05 19:43:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2022-12-05 19:43:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3467 transitions. [2022-12-05 19:43:36,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3086716524216524 [2022-12-05 19:43:36,373 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 478 flow. Second operand 54 states and 3467 transitions. [2022-12-05 19:43:36,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 509 transitions, 2478 flow [2022-12-05 19:43:36,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 509 transitions, 2453 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-05 19:43:36,430 INFO L231 Difference]: Finished difference. Result has 258 places, 263 transitions, 1081 flow [2022-12-05 19:43:36,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1081, PETRI_PLACES=258, PETRI_TRANSITIONS=263} [2022-12-05 19:43:36,431 INFO L294 CegarLoopForPetriNet]: 185 programPoint places, 73 predicate places. [2022-12-05 19:43:36,431 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 263 transitions, 1081 flow [2022-12-05 19:43:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 60.68493150684932) internal successors, (4430), 73 states have internal predecessors, (4430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:43:36,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:43:36,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 19:43:36,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-05 19:43:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:43:36,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-05 19:43:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:43:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1245443043, now seen corresponding path program 2 times [2022-12-05 19:43:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:43:36,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027591696] [2022-12-05 19:43:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:43:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:43:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:43:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-05 19:43:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:43:39,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027591696] [2022-12-05 19:43:39,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027591696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:43:39,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258522225] [2022-12-05 19:43:39,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:43:39,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:43:39,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:43:39,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:43:39,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 19:43:39,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:43:39,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:43:39,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-05 19:43:39,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:43:40,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:43:40,852 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-05 19:43:40,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-05 19:43:41,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-05 19:43:41,674 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-05 19:43:41,674 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 16 treesize of output 18 [2022-12-05 19:43:41,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:43:42,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:43:42,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:43:42,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:43:42,838 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-05 19:43:42,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-12-05 19:43:43,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:43:43,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2022-12-05 19:43:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:43:43,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:43:46,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int)) (let ((.cse5 (let ((.cse6 (* c_thread2Thread1of1ForFork1_~i~1 4))) (store (select |c_#memory_int| c_~C~0.base) (+ .cse6 ~C~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse6)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse6 c_~B~0.offset))))))) (let ((.cse3 (store |c_#memory_int| c_~C~0.base .cse5)) (.cse4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse0 (select .cse5 ~C~0.offset)) (.cse1 (select (select .cse3 c_~A~0.base) (+ c_~A~0.offset .cse4))) (.cse2 (select (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset)))) (= (+ c_~asum~0 c_~bsum~0 (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296) .cse1 .cse2) (+ .cse0 c_~csum~0 (* (div (+ c_~asum~0 c_~bsum~0 .cse1 .cse2) 4294967296) 4294967296))))))) is different from false [2022-12-05 19:43:46,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_323 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select .cse6 c_~B~0.base) c_~B~0.offset))) (let ((.cse4 (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) ~C~0.offset (+ .cse0 .cse3)))) (.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse1 (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset))) (.cse2 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))) (= (+ .cse0 c_~csum~0 (* (div (+ .cse1 .cse2 c_~asum~0 c_~bsum~0) 4294967296) 4294967296) .cse3) (+ .cse1 .cse2 c_~asum~0 c_~bsum~0 (* (div (+ .cse0 c_~csum~0 .cse3) 4294967296) 4294967296)))))))) is different from false [2022-12-05 19:43:46,566 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse2 (select (select .cse6 c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) ~C~0.offset (+ .cse2 .cse3)))) (.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse0 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5))) (.cse1 (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)))) (= (+ .cse0 c_~asum~0 c_~bsum~0 .cse1 (* (div (+ .cse2 .cse3 c_~csum~0) 4294967296) 4294967296)) (+ .cse2 .cse3 (* (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse1) 4294967296) 4294967296) c_~csum~0))))))) is different from false [2022-12-05 19:43:46,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse2 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) ~C~0.offset (+ .cse2 .cse3))))) (let ((.cse0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse1 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (= (+ (* 4294967296 (div (+ c_~asum~0 .cse0 c_~bsum~0 .cse1) 4294967296)) .cse2 .cse3 c_~csum~0) (+ c_~asum~0 .cse0 c_~bsum~0 .cse1 (* (div (+ .cse2 .cse3 c_~csum~0) 4294967296) 4294967296)))))))) is different from false [2022-12-05 19:43:46,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse1 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) ~C~0.offset (+ .cse1 .cse2))))) (let ((.cse0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (= (+ c_~asum~0 c_~bsum~0 .cse0 (* (div (+ .cse1 .cse2 c_~csum~0) 4294967296) 4294967296) .cse3) (+ .cse1 .cse2 (* (div (+ c_~asum~0 c_~bsum~0 .cse0 .cse3) 4294967296) 4294967296) c_~csum~0))))))) is different from false [2022-12-05 19:43:46,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse0 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) ~C~0.offset (+ .cse0 .cse1))))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (= (+ .cse0 .cse1 c_~csum~0 (* 4294967296 (div (+ c_~asum~0 .cse2 c_~bsum~0 .cse3) 4294967296))) (+ c_~asum~0 .cse2 c_~bsum~0 (* (div (+ .cse0 .cse1 c_~csum~0) 4294967296) 4294967296) .cse3))))))) is different from false [2022-12-05 19:43:46,715 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse1 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) ~C~0.offset (+ .cse1 .cse2))))) (let ((.cse0 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (= (+ .cse0 c_~asum~0 c_~bsum~0 (* (div (+ .cse1 .cse2 c_~csum~0) 4294967296) 4294967296) .cse3) (+ (* (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse3) 4294967296) 4294967296) .cse1 .cse2 c_~csum~0))))))) is different from false [2022-12-05 19:43:46,735 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse1 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset (+ .cse1 .cse2))))) (let ((.cse0 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (= (+ c_~asum~0 .cse0 c_~bsum~0 (* (div (+ .cse1 .cse2 c_~csum~0) 4294967296) 4294967296) .cse3) (+ .cse1 .cse2 (* (div (+ c_~asum~0 .cse0 c_~bsum~0 .cse3) 4294967296) 4294967296) c_~csum~0))))))) is different from false [2022-12-05 19:43:46,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse1 (select (select .cse5 c_~A~0.base) c_~A~0.offset)) (.cse2 (select (select .cse5 c_~B~0.base) c_~B~0.offset))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset (+ .cse1 .cse2))))) (let ((.cse0 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (= (+ c_~asum~0 c_~bsum~0 .cse0 (* (div (+ .cse1 .cse2 c_~csum~0) 4294967296) 4294967296) .cse3) (+ (* (div (+ c_~asum~0 c_~bsum~0 .cse0 .cse3) 4294967296) 4294967296) .cse1 .cse2 c_~csum~0))))))) is different from false [2022-12-05 19:43:46,847 WARN L837 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_323))) (let ((.cse1 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base|) ~C~0.offset (+ .cse1 .cse2))))) (let ((.cse0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (= (+ .cse0 (* (div (+ c_~csum~0 .cse1 .cse2) 4294967296) 4294967296) c_~asum~0 .cse3 c_~bsum~0) (+ (* (div (+ .cse0 c_~asum~0 .cse3 c_~bsum~0) 4294967296) 4294967296) c_~csum~0 .cse1 .cse2))))))) is different from false [2022-12-05 19:43:49,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:43:49,985 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 611 treesize of output 384