/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 07:40:47,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 07:40:47,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 07:40:47,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 07:40:47,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 07:40:47,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 07:40:47,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 07:40:47,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 07:40:47,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 07:40:47,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 07:40:47,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 07:40:47,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 07:40:47,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 07:40:47,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 07:40:47,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 07:40:47,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 07:40:47,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 07:40:47,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 07:40:47,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 07:40:47,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 07:40:47,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 07:40:47,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 07:40:47,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 07:40:47,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 07:40:47,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 07:40:47,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 07:40:47,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 07:40:47,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 07:40:47,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 07:40:47,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 07:40:47,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 07:40:47,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 07:40:47,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 07:40:47,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 07:40:47,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 07:40:47,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 07:40:47,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 07:40:47,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 07:40:47,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 07:40:47,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 07:40:47,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 07:40:47,279 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-Before.epf [2022-01-19 07:40:47,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 07:40:47,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 07:40:47,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 07:40:47,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 07:40:47,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 07:40:47,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 07:40:47,304 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 07:40:47,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 07:40:47,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 07:40:47,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 07:40:47,305 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 07:40:47,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 07:40:47,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:40:47,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 07:40:47,307 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 07:40:47,307 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-01-19 07:40:47,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 07:40:47,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 07:40:47,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 07:40:47,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 07:40:47,526 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 07:40:47,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-01-19 07:40:47,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040324360/414bbaa0fcc741df829e8400dfba1dbc/FLAGc0fa2498f [2022-01-19 07:40:47,953 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 07:40:47,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-01-19 07:40:47,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040324360/414bbaa0fcc741df829e8400dfba1dbc/FLAGc0fa2498f [2022-01-19 07:40:47,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040324360/414bbaa0fcc741df829e8400dfba1dbc [2022-01-19 07:40:47,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 07:40:47,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 07:40:47,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 07:40:47,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 07:40:47,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 07:40:47,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:40:47" (1/1) ... [2022-01-19 07:40:47,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ba2127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:47, skipping insertion in model container [2022-01-19 07:40:47,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:40:47" (1/1) ... [2022-01-19 07:40:47,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 07:40:48,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 07:40:48,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-01-19 07:40:48,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:40:48,217 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 07:40:48,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-01-19 07:40:48,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:40:48,256 INFO L208 MainTranslator]: Completed translation [2022-01-19 07:40:48,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48 WrapperNode [2022-01-19 07:40:48,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 07:40:48,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 07:40:48,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 07:40:48,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 07:40:48,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,290 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-01-19 07:40:48,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 07:40:48,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 07:40:48,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 07:40:48,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 07:40:48,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 07:40:48,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 07:40:48,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 07:40:48,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 07:40:48,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (1/1) ... [2022-01-19 07:40:48,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:40:48,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:48,352 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-01-19 07:40:48,358 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-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 07:40:48,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 07:40:48,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 07:40:48,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 07:40:48,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 07:40:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 07:40:48,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 07:40:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 07:40:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 07:40:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 07:40:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 07:40:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 07:40:48,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 07:40:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 07:40:48,382 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 07:40:48,466 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 07:40:48,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 07:40:48,796 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 07:40:48,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 07:40:48,882 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 07:40:48,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:40:48 BoogieIcfgContainer [2022-01-19 07:40:48,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 07:40:48,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 07:40:48,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 07:40:48,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 07:40:48,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 07:40:47" (1/3) ... [2022-01-19 07:40:48,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d3493c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:40:48, skipping insertion in model container [2022-01-19 07:40:48,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:40:48" (2/3) ... [2022-01-19 07:40:48,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d3493c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:40:48, skipping insertion in model container [2022-01-19 07:40:48,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:40:48" (3/3) ... [2022-01-19 07:40:48,891 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-01-19 07:40:48,894 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 07:40:48,894 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 07:40:48,894 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 07:40:48,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,956 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,959 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,960 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,961 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,969 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,970 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,975 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,976 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,977 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,978 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,983 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,984 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,985 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,985 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,986 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,987 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,988 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,988 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,988 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,988 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,989 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,990 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,994 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,995 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,996 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,997 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,998 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:48,999 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,001 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,005 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,006 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,011 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,012 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,013 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:40:49,019 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-01-19 07:40:49,059 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 07:40:49,065 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 07:40:49,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 07:40:49,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 205 transitions, 454 flow [2022-01-19 07:40:49,153 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2022-01-19 07:40:49,153 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 07:40:49,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 190 events. 14/190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2022-01-19 07:40:49,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 205 transitions, 454 flow [2022-01-19 07:40:49,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 392 flow [2022-01-19 07:40:49,203 INFO L129 PetriNetUnfolder]: 14/180 cut-off events. [2022-01-19 07:40:49,203 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 07:40:49,203 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:49,204 INFO L254 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] [2022-01-19 07:40:49,204 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1446293919, now seen corresponding path program 1 times [2022-01-19 07:40:49,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:49,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392375559] [2022-01-19 07:40:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:49,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:49,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392375559] [2022-01-19 07:40:49,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392375559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:40:49,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:40:49,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 07:40:49,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979684780] [2022-01-19 07:40:49,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:49,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 07:40:49,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 07:40:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 07:40:49,462 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 207 [2022-01-19 07:40:49,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 392 flow. Second operand has 2 states, 2 states have (on average 181.0) internal successors, (362), 2 states have internal predecessors, (362), 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-01-19 07:40:49,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:49,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 207 [2022-01-19 07:40:49,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:49,584 INFO L129 PetriNetUnfolder]: 191/594 cut-off events. [2022-01-19 07:40:49,585 INFO L130 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-01-19 07:40:49,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 594 events. 191/594 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2256 event pairs, 111 based on Foata normal form. 64/606 useless extension candidates. Maximal degree in co-relation 865. Up to 286 conditions per place. [2022-01-19 07:40:49,592 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 21 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2022-01-19 07:40:49,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 173 transitions, 418 flow [2022-01-19 07:40:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 07:40:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 07:40:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 375 transitions. [2022-01-19 07:40:49,606 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2022-01-19 07:40:49,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 375 transitions. [2022-01-19 07:40:49,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 375 transitions. [2022-01-19 07:40:49,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:49,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 375 transitions. [2022-01-19 07:40:49,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 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-01-19 07:40:49,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-01-19 07:40:49,619 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-01-19 07:40:49,620 INFO L186 Difference]: Start difference. First operand has 180 places, 181 transitions, 392 flow. Second operand 2 states and 375 transitions. [2022-01-19 07:40:49,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 173 transitions, 418 flow [2022-01-19 07:40:49,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 173 transitions, 398 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 07:40:49,627 INFO L242 Difference]: Finished difference. Result has 173 places, 169 transitions, 348 flow [2022-01-19 07:40:49,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=348, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2022-01-19 07:40:49,632 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, -7 predicate places. [2022-01-19 07:40:49,632 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 348 flow [2022-01-19 07:40:49,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 181.0) internal successors, (362), 2 states have internal predecessors, (362), 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-01-19 07:40:49,632 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:49,633 INFO L254 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] [2022-01-19 07:40:49,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 07:40:49,633 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:49,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2127134419, now seen corresponding path program 1 times [2022-01-19 07:40:49,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:49,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387800484] [2022-01-19 07:40:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:49,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:49,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387800484] [2022-01-19 07:40:49,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387800484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:40:49,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:40:49,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:40:49,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173642179] [2022-01-19 07:40:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:49,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:40:49,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:40:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:40:49,873 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 207 [2022-01-19 07:40:49,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-01-19 07:40:49,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:49,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 207 [2022-01-19 07:40:49,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:50,201 INFO L129 PetriNetUnfolder]: 481/1385 cut-off events. [2022-01-19 07:40:50,201 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-01-19 07:40:50,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 1385 events. 481/1385 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8491 event pairs, 149 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 2209. Up to 353 conditions per place. [2022-01-19 07:40:50,210 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 69 selfloop transitions, 10 changer transitions 4/211 dead transitions. [2022-01-19 07:40:50,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 211 transitions, 614 flow [2022-01-19 07:40:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 07:40:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 07:40:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2022-01-19 07:40:50,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7874396135265701 [2022-01-19 07:40:50,214 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:50,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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-01-19 07:40:50,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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-01-19 07:40:50,219 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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-01-19 07:40:50,219 INFO L186 Difference]: Start difference. First operand has 173 places, 169 transitions, 348 flow. Second operand 6 states and 978 transitions. [2022-01-19 07:40:50,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 211 transitions, 614 flow [2022-01-19 07:40:50,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 211 transitions, 614 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 07:40:50,226 INFO L242 Difference]: Finished difference. Result has 178 places, 175 transitions, 407 flow [2022-01-19 07:40:50,226 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=178, PETRI_TRANSITIONS=175} [2022-01-19 07:40:50,226 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, -2 predicate places. [2022-01-19 07:40:50,226 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 175 transitions, 407 flow [2022-01-19 07:40:50,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-01-19 07:40:50,227 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:50,227 INFO L254 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] [2022-01-19 07:40:50,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 07:40:50,228 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 283635425, now seen corresponding path program 1 times [2022-01-19 07:40:50,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:50,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270432646] [2022-01-19 07:40:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:50,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:50,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:50,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270432646] [2022-01-19 07:40:50,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270432646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:40:50,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:40:50,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 07:40:50,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861080863] [2022-01-19 07:40:50,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:50,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 07:40:50,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 07:40:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 07:40:50,393 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 207 [2022-01-19 07:40:50,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 175 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-01-19 07:40:50,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:50,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 207 [2022-01-19 07:40:50,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:50,714 INFO L129 PetriNetUnfolder]: 703/1924 cut-off events. [2022-01-19 07:40:50,714 INFO L130 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-01-19 07:40:50,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 1924 events. 703/1924 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12946 event pairs, 240 based on Foata normal form. 1/1743 useless extension candidates. Maximal degree in co-relation 3531. Up to 590 conditions per place. [2022-01-19 07:40:50,727 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 75 selfloop transitions, 10 changer transitions 4/217 dead transitions. [2022-01-19 07:40:50,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 217 transitions, 712 flow [2022-01-19 07:40:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 07:40:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 07:40:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2022-01-19 07:40:50,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7874396135265701 [2022-01-19 07:40:50,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:50,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2022-01-19 07:40:50,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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-01-19 07:40:50,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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-01-19 07:40:50,733 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 207.0) internal successors, (1449), 7 states have internal predecessors, (1449), 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-01-19 07:40:50,733 INFO L186 Difference]: Start difference. First operand has 178 places, 175 transitions, 407 flow. Second operand 6 states and 978 transitions. [2022-01-19 07:40:50,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 217 transitions, 712 flow [2022-01-19 07:40:50,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 217 transitions, 702 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-01-19 07:40:50,740 INFO L242 Difference]: Finished difference. Result has 183 places, 180 transitions, 473 flow [2022-01-19 07:40:50,741 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=473, PETRI_PLACES=183, PETRI_TRANSITIONS=180} [2022-01-19 07:40:50,742 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 3 predicate places. [2022-01-19 07:40:50,742 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 180 transitions, 473 flow [2022-01-19 07:40:50,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-01-19 07:40:50,743 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:50,743 INFO L254 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] [2022-01-19 07:40:50,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 07:40:50,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1054283516, now seen corresponding path program 1 times [2022-01-19 07:40:50,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:50,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226825111] [2022-01-19 07:40:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:50,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:50,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226825111] [2022-01-19 07:40:50,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226825111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:40:50,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:40:50,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 07:40:50,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508624419] [2022-01-19 07:40:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:50,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:40:50,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:40:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 07:40:50,858 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 207 [2022-01-19 07:40:50,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 180 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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-01-19 07:40:50,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:50,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 207 [2022-01-19 07:40:50,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:51,243 INFO L129 PetriNetUnfolder]: 1018/2906 cut-off events. [2022-01-19 07:40:51,243 INFO L130 PetriNetUnfolder]: For 1384/1384 co-relation queries the response was YES. [2022-01-19 07:40:51,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5645 conditions, 2906 events. 1018/2906 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22083 event pairs, 398 based on Foata normal form. 54/2671 useless extension candidates. Maximal degree in co-relation 5634. Up to 777 conditions per place. [2022-01-19 07:40:51,261 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 107 selfloop transitions, 8 changer transitions 0/246 dead transitions. [2022-01-19 07:40:51,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 246 transitions, 967 flow [2022-01-19 07:40:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:40:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:40:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1339 transitions. [2022-01-19 07:40:51,263 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8085748792270532 [2022-01-19 07:40:51,263 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1339 transitions. [2022-01-19 07:40:51,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1339 transitions. [2022-01-19 07:40:51,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:51,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1339 transitions. [2022-01-19 07:40:51,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 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-01-19 07:40:51,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 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-01-19 07:40:51,269 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 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-01-19 07:40:51,269 INFO L186 Difference]: Start difference. First operand has 183 places, 180 transitions, 473 flow. Second operand 8 states and 1339 transitions. [2022-01-19 07:40:51,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 246 transitions, 967 flow [2022-01-19 07:40:51,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 246 transitions, 961 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 07:40:51,277 INFO L242 Difference]: Finished difference. Result has 190 places, 185 transitions, 529 flow [2022-01-19 07:40:51,277 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=529, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2022-01-19 07:40:51,278 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 10 predicate places. [2022-01-19 07:40:51,278 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 529 flow [2022-01-19 07:40:51,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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-01-19 07:40:51,279 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:51,279 INFO L254 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] [2022-01-19 07:40:51,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 07:40:51,279 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1131479502, now seen corresponding path program 1 times [2022-01-19 07:40:51,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:51,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257918033] [2022-01-19 07:40:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:51,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:51,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257918033] [2022-01-19 07:40:51,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257918033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:40:51,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:40:51,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 07:40:51,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006469138] [2022-01-19 07:40:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:51,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:40:51,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:40:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 07:40:51,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 207 [2022-01-19 07:40:51,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 529 flow. Second operand has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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-01-19 07:40:51,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:51,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 207 [2022-01-19 07:40:51,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:51,733 INFO L129 PetriNetUnfolder]: 780/2319 cut-off events. [2022-01-19 07:40:51,734 INFO L130 PetriNetUnfolder]: For 1480/1480 co-relation queries the response was YES. [2022-01-19 07:40:51,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 2319 events. 780/2319 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 16358 event pairs, 469 based on Foata normal form. 36/2134 useless extension candidates. Maximal degree in co-relation 4762. Up to 1057 conditions per place. [2022-01-19 07:40:51,745 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 49 selfloop transitions, 4 changer transitions 20/204 dead transitions. [2022-01-19 07:40:51,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 204 transitions, 738 flow [2022-01-19 07:40:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:40:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:40:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1155 transitions. [2022-01-19 07:40:51,748 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2022-01-19 07:40:51,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1155 transitions. [2022-01-19 07:40:51,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1155 transitions. [2022-01-19 07:40:51,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:51,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1155 transitions. [2022-01-19 07:40:51,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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-01-19 07:40:51,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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-01-19 07:40:51,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 207.0) internal successors, (1656), 8 states have internal predecessors, (1656), 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-01-19 07:40:51,752 INFO L186 Difference]: Start difference. First operand has 190 places, 185 transitions, 529 flow. Second operand 7 states and 1155 transitions. [2022-01-19 07:40:51,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 204 transitions, 738 flow [2022-01-19 07:40:51,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 204 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 07:40:51,757 INFO L242 Difference]: Finished difference. Result has 196 places, 181 transitions, 508 flow [2022-01-19 07:40:51,757 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=196, PETRI_TRANSITIONS=181} [2022-01-19 07:40:51,758 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2022-01-19 07:40:51,759 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 181 transitions, 508 flow [2022-01-19 07:40:51,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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-01-19 07:40:51,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:51,759 INFO L254 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-01-19 07:40:51,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 07:40:51,760 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -587263874, now seen corresponding path program 1 times [2022-01-19 07:40:51,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:51,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686677035] [2022-01-19 07:40:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:51,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:51,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:51,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686677035] [2022-01-19 07:40:51,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686677035] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:51,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640961606] [2022-01-19 07:40:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:51,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:51,876 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-01-19 07:40:51,877 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-01-19 07:40:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:52,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 07:40:52,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:40:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:52,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:40:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:52,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640961606] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:40:52,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:40:52,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 07:40:52,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324477236] [2022-01-19 07:40:52,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:40:52,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 07:40:52,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 07:40:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 07:40:52,662 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 07:40:52,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 181 transitions, 508 flow. Second operand has 19 states, 19 states have (on average 158.0) internal successors, (3002), 19 states have internal predecessors, (3002), 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-01-19 07:40:52,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:52,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 07:40:52,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:53,222 INFO L129 PetriNetUnfolder]: 1018/2909 cut-off events. [2022-01-19 07:40:53,222 INFO L130 PetriNetUnfolder]: For 2212/2212 co-relation queries the response was YES. [2022-01-19 07:40:53,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6340 conditions, 2909 events. 1018/2909 cut-off events. For 2212/2212 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22115 event pairs, 400 based on Foata normal form. 54/2678 useless extension candidates. Maximal degree in co-relation 6324. Up to 775 conditions per place. [2022-01-19 07:40:53,238 INFO L132 encePairwiseOnDemand]: 193/207 looper letters, 105 selfloop transitions, 16 changer transitions 0/251 dead transitions. [2022-01-19 07:40:53,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 251 transitions, 1053 flow [2022-01-19 07:40:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 07:40:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 07:40:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2267 transitions. [2022-01-19 07:40:53,242 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.782263630089717 [2022-01-19 07:40:53,242 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2267 transitions. [2022-01-19 07:40:53,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2267 transitions. [2022-01-19 07:40:53,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:53,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2267 transitions. [2022-01-19 07:40:53,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 161.92857142857142) internal successors, (2267), 14 states have internal predecessors, (2267), 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-01-19 07:40:53,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 207.0) internal successors, (3105), 15 states have internal predecessors, (3105), 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-01-19 07:40:53,249 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 207.0) internal successors, (3105), 15 states have internal predecessors, (3105), 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-01-19 07:40:53,249 INFO L186 Difference]: Start difference. First operand has 196 places, 181 transitions, 508 flow. Second operand 14 states and 2267 transitions. [2022-01-19 07:40:53,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 251 transitions, 1053 flow [2022-01-19 07:40:53,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 251 transitions, 1013 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-01-19 07:40:53,256 INFO L242 Difference]: Finished difference. Result has 202 places, 189 transitions, 581 flow [2022-01-19 07:40:53,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=581, PETRI_PLACES=202, PETRI_TRANSITIONS=189} [2022-01-19 07:40:53,257 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 22 predicate places. [2022-01-19 07:40:53,257 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 189 transitions, 581 flow [2022-01-19 07:40:53,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 158.0) internal successors, (3002), 19 states have internal predecessors, (3002), 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-01-19 07:40:53,258 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:53,258 INFO L254 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-01-19 07:40:53,277 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-01-19 07:40:53,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 07:40:53,471 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2110527098, now seen corresponding path program 1 times [2022-01-19 07:40:53,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229915180] [2022-01-19 07:40:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:53,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:53,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229915180] [2022-01-19 07:40:53,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229915180] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:53,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443529352] [2022-01-19 07:40:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:53,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:53,550 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-01-19 07:40:53,551 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-01-19 07:40:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:53,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 07:40:53,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:40:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:53,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:40:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:40:54,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443529352] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:40:54,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:40:54,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 07:40:54,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160038555] [2022-01-19 07:40:54,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:40:54,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 07:40:54,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 07:40:54,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 07:40:54,234 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 07:40:54,236 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 189 transitions, 581 flow. Second operand has 19 states, 19 states have (on average 158.31578947368422) internal successors, (3008), 19 states have internal predecessors, (3008), 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-01-19 07:40:54,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:54,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 07:40:54,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:54,718 INFO L129 PetriNetUnfolder]: 723/2424 cut-off events. [2022-01-19 07:40:54,718 INFO L130 PetriNetUnfolder]: For 1759/1759 co-relation queries the response was YES. [2022-01-19 07:40:54,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5063 conditions, 2424 events. 723/2424 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 17869 event pairs, 197 based on Foata normal form. 91/2310 useless extension candidates. Maximal degree in co-relation 5045. Up to 609 conditions per place. [2022-01-19 07:40:54,732 INFO L132 encePairwiseOnDemand]: 191/207 looper letters, 65 selfloop transitions, 14 changer transitions 20/229 dead transitions. [2022-01-19 07:40:54,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 229 transitions, 966 flow [2022-01-19 07:40:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 07:40:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 07:40:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2251 transitions. [2022-01-19 07:40:54,736 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7767425810904072 [2022-01-19 07:40:54,736 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2251 transitions. [2022-01-19 07:40:54,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2251 transitions. [2022-01-19 07:40:54,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:54,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2251 transitions. [2022-01-19 07:40:54,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 160.78571428571428) internal successors, (2251), 14 states have internal predecessors, (2251), 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-01-19 07:40:54,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 207.0) internal successors, (3105), 15 states have internal predecessors, (3105), 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-01-19 07:40:54,744 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 207.0) internal successors, (3105), 15 states have internal predecessors, (3105), 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-01-19 07:40:54,744 INFO L186 Difference]: Start difference. First operand has 202 places, 189 transitions, 581 flow. Second operand 14 states and 2251 transitions. [2022-01-19 07:40:54,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 229 transitions, 966 flow [2022-01-19 07:40:54,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 229 transitions, 949 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 07:40:54,748 INFO L242 Difference]: Finished difference. Result has 214 places, 187 transitions, 586 flow [2022-01-19 07:40:54,749 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=586, PETRI_PLACES=214, PETRI_TRANSITIONS=187} [2022-01-19 07:40:54,749 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 34 predicate places. [2022-01-19 07:40:54,749 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 187 transitions, 586 flow [2022-01-19 07:40:54,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 158.31578947368422) internal successors, (3008), 19 states have internal predecessors, (3008), 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-01-19 07:40:54,750 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:54,750 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:40:54,767 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-01-19 07:40:54,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-19 07:40:54,964 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 211300924, now seen corresponding path program 2 times [2022-01-19 07:40:54,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:54,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304328221] [2022-01-19 07:40:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:54,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:55,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:55,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304328221] [2022-01-19 07:40:55,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304328221] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:55,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720465537] [2022-01-19 07:40:55,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:40:55,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:55,128 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-01-19 07:40:55,129 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-01-19 07:40:55,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 07:40:55,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:40:55,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 07:40:55,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:40:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:55,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:40:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:55,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720465537] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:55,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 07:40:55,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-01-19 07:40:55,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082456197] [2022-01-19 07:40:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:55,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 07:40:55,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 07:40:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-19 07:40:55,844 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 07:40:55,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 187 transitions, 586 flow. Second operand has 9 states, 9 states have (on average 159.22222222222223) internal successors, (1433), 9 states have internal predecessors, (1433), 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-01-19 07:40:55,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:55,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 07:40:55,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:56,117 INFO L129 PetriNetUnfolder]: 493/1507 cut-off events. [2022-01-19 07:40:56,117 INFO L130 PetriNetUnfolder]: For 1816/1816 co-relation queries the response was YES. [2022-01-19 07:40:56,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 1507 events. 493/1507 cut-off events. For 1816/1816 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9559 event pairs, 213 based on Foata normal form. 31/1408 useless extension candidates. Maximal degree in co-relation 3729. Up to 694 conditions per place. [2022-01-19 07:40:56,128 INFO L132 encePairwiseOnDemand]: 195/207 looper letters, 58 selfloop transitions, 11 changer transitions 0/199 dead transitions. [2022-01-19 07:40:56,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 199 transitions, 793 flow [2022-01-19 07:40:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 07:40:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 07:40:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1605 transitions. [2022-01-19 07:40:56,131 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7753623188405797 [2022-01-19 07:40:56,132 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1605 transitions. [2022-01-19 07:40:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1605 transitions. [2022-01-19 07:40:56,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:56,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1605 transitions. [2022-01-19 07:40:56,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 160.5) internal successors, (1605), 10 states have internal predecessors, (1605), 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-01-19 07:40:56,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 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-01-19 07:40:56,138 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 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-01-19 07:40:56,138 INFO L186 Difference]: Start difference. First operand has 214 places, 187 transitions, 586 flow. Second operand 10 states and 1605 transitions. [2022-01-19 07:40:56,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 199 transitions, 793 flow [2022-01-19 07:40:56,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 740 flow, removed 17 selfloop flow, removed 14 redundant places. [2022-01-19 07:40:56,143 INFO L242 Difference]: Finished difference. Result has 207 places, 190 transitions, 595 flow [2022-01-19 07:40:56,143 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=595, PETRI_PLACES=207, PETRI_TRANSITIONS=190} [2022-01-19 07:40:56,145 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 27 predicate places. [2022-01-19 07:40:56,145 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 190 transitions, 595 flow [2022-01-19 07:40:56,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 159.22222222222223) internal successors, (1433), 9 states have internal predecessors, (1433), 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-01-19 07:40:56,146 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:56,146 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:40:56,171 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-01-19 07:40:56,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:56,363 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1954702868, now seen corresponding path program 2 times [2022-01-19 07:40:56,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:56,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392443467] [2022-01-19 07:40:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:56,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:56,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:56,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392443467] [2022-01-19 07:40:56,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392443467] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:56,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964057597] [2022-01-19 07:40:56,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:40:56,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:56,465 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-01-19 07:40:56,467 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-01-19 07:40:56,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 07:40:56,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:40:56,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 07:40:56,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:40:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:56,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:40:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:40:57,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964057597] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:57,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 07:40:57,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-01-19 07:40:57,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491674194] [2022-01-19 07:40:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:40:57,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 07:40:57,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 07:40:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-19 07:40:57,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 07:40:57,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 190 transitions, 595 flow. Second operand has 9 states, 9 states have (on average 159.22222222222223) internal successors, (1433), 9 states have internal predecessors, (1433), 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-01-19 07:40:57,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:57,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 07:40:57,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:40:57,362 INFO L129 PetriNetUnfolder]: 419/1263 cut-off events. [2022-01-19 07:40:57,362 INFO L130 PetriNetUnfolder]: For 1224/1224 co-relation queries the response was YES. [2022-01-19 07:40:57,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 1263 events. 419/1263 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7394 event pairs, 169 based on Foata normal form. 38/1188 useless extension candidates. Maximal degree in co-relation 3025. Up to 542 conditions per place. [2022-01-19 07:40:57,369 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 74 selfloop transitions, 10 changer transitions 0/214 dead transitions. [2022-01-19 07:40:57,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 214 transitions, 886 flow [2022-01-19 07:40:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 07:40:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 07:40:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1611 transitions. [2022-01-19 07:40:57,372 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7782608695652173 [2022-01-19 07:40:57,372 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1611 transitions. [2022-01-19 07:40:57,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1611 transitions. [2022-01-19 07:40:57,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:40:57,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1611 transitions. [2022-01-19 07:40:57,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 161.1) internal successors, (1611), 10 states have internal predecessors, (1611), 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-01-19 07:40:57,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 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-01-19 07:40:57,377 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 207.0) internal successors, (2277), 11 states have internal predecessors, (2277), 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-01-19 07:40:57,377 INFO L186 Difference]: Start difference. First operand has 207 places, 190 transitions, 595 flow. Second operand 10 states and 1611 transitions. [2022-01-19 07:40:57,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 214 transitions, 886 flow [2022-01-19 07:40:57,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 214 transitions, 855 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-01-19 07:40:57,382 INFO L242 Difference]: Finished difference. Result has 210 places, 191 transitions, 600 flow [2022-01-19 07:40:57,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=600, PETRI_PLACES=210, PETRI_TRANSITIONS=191} [2022-01-19 07:40:57,382 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 30 predicate places. [2022-01-19 07:40:57,382 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 191 transitions, 600 flow [2022-01-19 07:40:57,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 159.22222222222223) internal successors, (1433), 9 states have internal predecessors, (1433), 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-01-19 07:40:57,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:40:57,383 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:40:57,399 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-01-19 07:40:57,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:57,600 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:40:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:40:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1058627067, now seen corresponding path program 1 times [2022-01-19 07:40:57,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:40:57,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088837950] [2022-01-19 07:40:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:57,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:40:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:40:57,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:40:57,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088837950] [2022-01-19 07:40:57,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088837950] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:40:57,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608938289] [2022-01-19 07:40:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:40:57,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:40:57,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:40:57,837 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-01-19 07:40:57,838 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-01-19 07:40:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:40:57,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-19 07:40:57,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:40:58,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-19 07:40:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 07:40:58,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:40:58,610 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:40:58,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-01-19 07:40:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:40:58,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608938289] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:40:58,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:40:58,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-01-19 07:40:58,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550119150] [2022-01-19 07:40:58,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:40:58,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 07:40:58,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:40:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 07:40:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-01-19 07:40:58,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 207 [2022-01-19 07:40:58,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 191 transitions, 600 flow. Second operand has 24 states, 24 states have (on average 116.70833333333333) internal successors, (2801), 24 states have internal predecessors, (2801), 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-01-19 07:40:58,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:40:58,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 207 [2022-01-19 07:40:58,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:41:01,075 INFO L129 PetriNetUnfolder]: 5301/10734 cut-off events. [2022-01-19 07:41:01,075 INFO L130 PetriNetUnfolder]: For 12113/12113 co-relation queries the response was YES. [2022-01-19 07:41:01,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28341 conditions, 10734 events. 5301/10734 cut-off events. For 12113/12113 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 89745 event pairs, 1137 based on Foata normal form. 2/10095 useless extension candidates. Maximal degree in co-relation 28321. Up to 3397 conditions per place. [2022-01-19 07:41:01,144 INFO L132 encePairwiseOnDemand]: 183/207 looper letters, 281 selfloop transitions, 81 changer transitions 8/462 dead transitions. [2022-01-19 07:41:01,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 462 transitions, 2487 flow [2022-01-19 07:41:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 07:41:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 07:41:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3799 transitions. [2022-01-19 07:41:01,152 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5920211937042231 [2022-01-19 07:41:01,152 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3799 transitions. [2022-01-19 07:41:01,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3799 transitions. [2022-01-19 07:41:01,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:41:01,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3799 transitions. [2022-01-19 07:41:01,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 122.54838709677419) internal successors, (3799), 31 states have internal predecessors, (3799), 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-01-19 07:41:01,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 207.0) internal successors, (6624), 32 states have internal predecessors, (6624), 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-01-19 07:41:01,165 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 207.0) internal successors, (6624), 32 states have internal predecessors, (6624), 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-01-19 07:41:01,165 INFO L186 Difference]: Start difference. First operand has 210 places, 191 transitions, 600 flow. Second operand 31 states and 3799 transitions. [2022-01-19 07:41:01,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 462 transitions, 2487 flow [2022-01-19 07:41:01,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 462 transitions, 2454 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 07:41:01,189 INFO L242 Difference]: Finished difference. Result has 248 places, 260 transitions, 1259 flow [2022-01-19 07:41:01,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1259, PETRI_PLACES=248, PETRI_TRANSITIONS=260} [2022-01-19 07:41:01,191 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 68 predicate places. [2022-01-19 07:41:01,191 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 260 transitions, 1259 flow [2022-01-19 07:41:01,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 116.70833333333333) internal successors, (2801), 24 states have internal predecessors, (2801), 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-01-19 07:41:01,192 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:41:01,192 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:41:01,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 07:41:01,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 07:41:01,407 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:41:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:41:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 756627477, now seen corresponding path program 2 times [2022-01-19 07:41:01,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:41:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60657825] [2022-01-19 07:41:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:41:01,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:41:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:41:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:41:01,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:41:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60657825] [2022-01-19 07:41:01,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60657825] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:41:01,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317467173] [2022-01-19 07:41:01,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:41:01,806 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:41:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:41:01,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 07:41:01,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 07:41:01,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 07:41:01,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:41:01,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-19 07:41:01,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:41:02,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:41:02,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:41:02,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-19 07:41:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:41:02,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:41:02,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-01-19 07:41:02,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-01-19 07:41:02,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:41:02,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2022-01-19 07:41:02,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-19 07:41:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-01-19 07:41:03,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317467173] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:41:03,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:41:03,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-01-19 07:41:03,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071321010] [2022-01-19 07:41:03,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:41:03,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-19 07:41:03,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:41:03,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-19 07:41:03,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1152, Unknown=2, NotChecked=138, Total=1406 [2022-01-19 07:41:03,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2022-01-19 07:41:03,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 260 transitions, 1259 flow. Second operand has 38 states, 38 states have (on average 114.15789473684211) internal successors, (4338), 38 states have internal predecessors, (4338), 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-01-19 07:41:03,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:41:03,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2022-01-19 07:41:03,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:41:09,059 INFO L129 PetriNetUnfolder]: 16199/30595 cut-off events. [2022-01-19 07:41:09,060 INFO L130 PetriNetUnfolder]: For 95795/95903 co-relation queries the response was YES. [2022-01-19 07:41:09,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104741 conditions, 30595 events. 16199/30595 cut-off events. For 95795/95903 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 287475 event pairs, 1170 based on Foata normal form. 86/28934 useless extension candidates. Maximal degree in co-relation 104705. Up to 8412 conditions per place. [2022-01-19 07:41:09,357 INFO L132 encePairwiseOnDemand]: 177/207 looper letters, 467 selfloop transitions, 410 changer transitions 4/978 dead transitions. [2022-01-19 07:41:09,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 978 transitions, 8090 flow [2022-01-19 07:41:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 07:41:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 07:41:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 6439 transitions. [2022-01-19 07:41:09,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5869109470422021 [2022-01-19 07:41:09,365 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 6439 transitions. [2022-01-19 07:41:09,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 6439 transitions. [2022-01-19 07:41:09,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:41:09,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 6439 transitions. [2022-01-19 07:41:09,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 121.49056603773585) internal successors, (6439), 53 states have internal predecessors, (6439), 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-01-19 07:41:09,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 207.0) internal successors, (11178), 54 states have internal predecessors, (11178), 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-01-19 07:41:09,391 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 207.0) internal successors, (11178), 54 states have internal predecessors, (11178), 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-01-19 07:41:09,391 INFO L186 Difference]: Start difference. First operand has 248 places, 260 transitions, 1259 flow. Second operand 53 states and 6439 transitions. [2022-01-19 07:41:09,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 978 transitions, 8090 flow [2022-01-19 07:41:09,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 978 transitions, 7821 flow, removed 122 selfloop flow, removed 14 redundant places. [2022-01-19 07:41:09,952 INFO L242 Difference]: Finished difference. Result has 321 places, 715 transitions, 6569 flow [2022-01-19 07:41:09,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=6569, PETRI_PLACES=321, PETRI_TRANSITIONS=715} [2022-01-19 07:41:09,953 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 141 predicate places. [2022-01-19 07:41:09,953 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 715 transitions, 6569 flow [2022-01-19 07:41:09,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 114.15789473684211) internal successors, (4338), 38 states have internal predecessors, (4338), 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-01-19 07:41:09,954 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:41:09,955 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:41:09,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 07:41:10,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:41:10,168 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:41:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:41:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1614840025, now seen corresponding path program 3 times [2022-01-19 07:41:10,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:41:10,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402020676] [2022-01-19 07:41:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:41:10,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:41:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:41:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:41:10,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:41:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402020676] [2022-01-19 07:41:10,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402020676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:41:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66681912] [2022-01-19 07:41:10,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 07:41:10,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:41:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:41:10,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 07:41:10,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 07:41:10,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 07:41:10,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:41:10,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-19 07:41:10,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:41:11,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:41:11,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:41:11,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:41:11,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:41:11,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-19 07:41:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:41:11,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:41:11,478 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_431 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0)))) is different from false [2022-01-19 07:41:11,514 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-01-19 07:41:11,532 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) is different from false [2022-01-19 07:41:11,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) is different from false [2022-01-19 07:41:11,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) is different from false [2022-01-19 07:41:11,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:41:11,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 145 [2022-01-19 07:41:11,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 121 [2022-01-19 07:41:11,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 117 [2022-01-19 07:41:11,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 109 [2022-01-19 07:41:11,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 105 [2022-01-19 07:41:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-01-19 07:41:12,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66681912] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:41:12,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:41:12,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2022-01-19 07:41:12,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296572400] [2022-01-19 07:41:12,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:41:12,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 07:41:12,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:41:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 07:41:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1497, Unknown=5, NotChecked=410, Total=2070 [2022-01-19 07:41:12,017 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 207 [2022-01-19 07:41:12,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 715 transitions, 6569 flow. Second operand has 46 states, 46 states have (on average 104.8695652173913) internal successors, (4824), 46 states have internal predecessors, (4824), 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-01-19 07:41:12,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:41:12,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 207 [2022-01-19 07:41:12,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:41:14,528 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= c_~s_6~0 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-01-19 07:41:16,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= c_~s_6~0 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= c_~s_6~0 c_~s_2~0) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (< c_~s_2~0 (+ c_~s_6~0 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) (= c_~X_0~0.offset 0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= (select .cse1 .cse0) c_~t_8~0))) is different from false [2022-01-19 07:41:18,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~X_0~0.base)) (.cse0 (+ c_~X_0~0.offset (* 4 c_~i_7~0)))) (let ((.cse1 (select .cse2 .cse0))) (and (= .cse0 4) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse1 c_~s_6~0) (= (+ c_~s_6~0 (* (- 1) (select .cse2 (+ c_~X_0~0.offset 4)))) 0) (<= c_~s_6~0 .cse1) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-01-19 07:41:20,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 4))) (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= c_~s_6~0 .cse0) (= (+ c_~s_6~0 (* (- 1) (select .cse1 (+ c_~X_0~0.offset 4)))) 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_30| Int)) (or (and (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_430) |v_thread1Thread1of1ForFork3_~#t3~0.base_30| v_ArrVal_431) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_30|)))) (<= .cse0 c_~s_6~0) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-01-19 07:41:35,575 INFO L129 PetriNetUnfolder]: 36332/71090 cut-off events. [2022-01-19 07:41:35,575 INFO L130 PetriNetUnfolder]: For 1445044/1446633 co-relation queries the response was YES. [2022-01-19 07:41:36,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465541 conditions, 71090 events. 36332/71090 cut-off events. For 1445044/1446633 co-relation queries the response was YES. Maximal size of possible extension queue 4532. Compared 776758 event pairs, 3899 based on Foata normal form. 441/67256 useless extension candidates. Maximal degree in co-relation 465470. Up to 21649 conditions per place. [2022-01-19 07:41:37,084 INFO L132 encePairwiseOnDemand]: 170/207 looper letters, 1514 selfloop transitions, 539 changer transitions 9/2154 dead transitions. [2022-01-19 07:41:37,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 2154 transitions, 26370 flow [2022-01-19 07:41:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 07:41:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 07:41:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3453 transitions. [2022-01-19 07:41:37,088 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5560386473429951 [2022-01-19 07:41:37,088 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3453 transitions. [2022-01-19 07:41:37,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3453 transitions. [2022-01-19 07:41:37,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:41:37,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3453 transitions. [2022-01-19 07:41:37,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 115.1) internal successors, (3453), 30 states have internal predecessors, (3453), 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-01-19 07:41:37,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 207.0) internal successors, (6417), 31 states have internal predecessors, (6417), 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-01-19 07:41:37,098 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 207.0) internal successors, (6417), 31 states have internal predecessors, (6417), 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-01-19 07:41:37,098 INFO L186 Difference]: Start difference. First operand has 321 places, 715 transitions, 6569 flow. Second operand 30 states and 3453 transitions. [2022-01-19 07:41:37,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 2154 transitions, 26370 flow [2022-01-19 07:41:52,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 2154 transitions, 24044 flow, removed 1157 selfloop flow, removed 8 redundant places. [2022-01-19 07:41:52,354 INFO L242 Difference]: Finished difference. Result has 359 places, 1200 transitions, 13289 flow [2022-01-19 07:41:52,355 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=5771, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=13289, PETRI_PLACES=359, PETRI_TRANSITIONS=1200} [2022-01-19 07:41:52,355 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 179 predicate places. [2022-01-19 07:41:52,355 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 1200 transitions, 13289 flow [2022-01-19 07:41:52,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 104.8695652173913) internal successors, (4824), 46 states have internal predecessors, (4824), 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-01-19 07:41:52,356 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:41:52,356 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:41:52,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 07:41:52,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:41:52,567 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:41:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:41:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1264713485, now seen corresponding path program 4 times [2022-01-19 07:41:52,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:41:52,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095223029] [2022-01-19 07:41:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:41:52,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:41:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:41:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:41:52,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:41:52,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095223029] [2022-01-19 07:41:52,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095223029] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:41:52,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825823598] [2022-01-19 07:41:52,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 07:41:52,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:41:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:41:52,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 07:41:52,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 07:41:52,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 07:41:52,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:41:52,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-19 07:41:52,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:41:53,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:41:53,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:41:53,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-19 07:41:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 07:41:53,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:41:53,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_480) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~s_2~0) 0)) is different from false [2022-01-19 07:41:53,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_480) c_~X_0~0.base) (+ c_~X_0~0.offset 4))) c_~t_4~0 c_~s_2~0) 0)) is different from false [2022-01-19 07:41:53,657 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:41:53,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2022-01-19 07:41:53,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-19 07:41:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-01-19 07:41:53,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825823598] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:41:53,919 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:41:53,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 41 [2022-01-19 07:41:53,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539869191] [2022-01-19 07:41:53,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:41:53,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 07:41:53,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:41:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 07:41:53,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1358, Unknown=2, NotChecked=150, Total=1640 [2022-01-19 07:41:53,923 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 207 [2022-01-19 07:41:53,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1200 transitions, 13289 flow. Second operand has 41 states, 41 states have (on average 108.60975609756098) internal successors, (4453), 41 states have internal predecessors, (4453), 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-01-19 07:41:53,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:41:53,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 207 [2022-01-19 07:41:53,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:42:27,430 INFO L129 PetriNetUnfolder]: 62548/123605 cut-off events. [2022-01-19 07:42:27,430 INFO L130 PetriNetUnfolder]: For 3549336/3552684 co-relation queries the response was YES. [2022-01-19 07:42:30,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1027654 conditions, 123605 events. 62548/123605 cut-off events. For 3549336/3552684 co-relation queries the response was YES. Maximal size of possible extension queue 7670. Compared 1463691 event pairs, 4560 based on Foata normal form. 1184/117047 useless extension candidates. Maximal degree in co-relation 1027565. Up to 55005 conditions per place. [2022-01-19 07:42:31,268 INFO L132 encePairwiseOnDemand]: 174/207 looper letters, 1527 selfloop transitions, 989 changer transitions 21/2634 dead transitions. [2022-01-19 07:42:31,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2634 transitions, 41277 flow [2022-01-19 07:42:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 07:42:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 07:42:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4801 transitions. [2022-01-19 07:42:31,272 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5656887003652645 [2022-01-19 07:42:31,273 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4801 transitions. [2022-01-19 07:42:31,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4801 transitions. [2022-01-19 07:42:31,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:42:31,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4801 transitions. [2022-01-19 07:42:31,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 117.09756097560975) internal successors, (4801), 41 states have internal predecessors, (4801), 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-01-19 07:42:31,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 207.0) internal successors, (8694), 42 states have internal predecessors, (8694), 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-01-19 07:42:31,285 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 207.0) internal successors, (8694), 42 states have internal predecessors, (8694), 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-01-19 07:42:31,285 INFO L186 Difference]: Start difference. First operand has 359 places, 1200 transitions, 13289 flow. Second operand 41 states and 4801 transitions. [2022-01-19 07:42:31,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 2634 transitions, 41277 flow [2022-01-19 07:43:54,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 2634 transitions, 36495 flow, removed 2385 selfloop flow, removed 8 redundant places. [2022-01-19 07:43:54,242 INFO L242 Difference]: Finished difference. Result has 409 places, 1789 transitions, 23977 flow [2022-01-19 07:43:54,243 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=12495, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=504, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=23977, PETRI_PLACES=409, PETRI_TRANSITIONS=1789} [2022-01-19 07:43:54,244 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 229 predicate places. [2022-01-19 07:43:54,244 INFO L470 AbstractCegarLoop]: Abstraction has has 409 places, 1789 transitions, 23977 flow [2022-01-19 07:43:54,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 108.60975609756098) internal successors, (4453), 41 states have internal predecessors, (4453), 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-01-19 07:43:54,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:43:54,245 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:43:54,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 07:43:54,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 07:43:54,451 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:43:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:43:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash -777772728, now seen corresponding path program 1 times [2022-01-19 07:43:54,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:43:54,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445225441] [2022-01-19 07:43:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:43:54,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:43:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:43:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:43:54,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:43:54,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445225441] [2022-01-19 07:43:54,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445225441] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:43:54,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258401152] [2022-01-19 07:43:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:43:54,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:43:54,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:43:54,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 07:43:54,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 07:43:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:43:54,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-19 07:43:54,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:43:55,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-19 07:43:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 07:43:55,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:43:55,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:43:55,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-19 07:43:55,458 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-01-19 07:43:55,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-01-19 07:43:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:43:55,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258401152] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:43:55,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:43:55,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 10] total 24 [2022-01-19 07:43:55,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682585817] [2022-01-19 07:43:55,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:43:55,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 07:43:55,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:43:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 07:43:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2022-01-19 07:43:55,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 207 [2022-01-19 07:43:55,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 1789 transitions, 23977 flow. Second operand has 24 states, 24 states have (on average 116.70833333333333) internal successors, (2801), 24 states have internal predecessors, (2801), 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-01-19 07:43:55,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:43:55,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 207 [2022-01-19 07:43:55,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:44:40,353 INFO L129 PetriNetUnfolder]: 67482/135489 cut-off events. [2022-01-19 07:44:40,353 INFO L130 PetriNetUnfolder]: For 4303190/4306720 co-relation queries the response was YES. [2022-01-19 07:44:43,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1169090 conditions, 135489 events. 67482/135489 cut-off events. For 4303190/4306720 co-relation queries the response was YES. Maximal size of possible extension queue 8633. Compared 1651986 event pairs, 13803 based on Foata normal form. 418/127361 useless extension candidates. Maximal degree in co-relation 1168982. Up to 85331 conditions per place. [2022-01-19 07:44:44,863 INFO L132 encePairwiseOnDemand]: 183/207 looper letters, 1844 selfloop transitions, 173 changer transitions 6/2137 dead transitions. [2022-01-19 07:44:44,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 2137 transitions, 33920 flow [2022-01-19 07:44:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 07:44:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 07:44:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2653 transitions. [2022-01-19 07:44:44,868 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5825647782169522 [2022-01-19 07:44:44,868 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2653 transitions. [2022-01-19 07:44:44,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2653 transitions. [2022-01-19 07:44:44,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:44:44,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2653 transitions. [2022-01-19 07:44:44,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 120.5909090909091) internal successors, (2653), 22 states have internal predecessors, (2653), 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-01-19 07:44:44,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 207.0) internal successors, (4761), 23 states have internal predecessors, (4761), 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-01-19 07:44:44,874 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 207.0) internal successors, (4761), 23 states have internal predecessors, (4761), 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-01-19 07:44:44,874 INFO L186 Difference]: Start difference. First operand has 409 places, 1789 transitions, 23977 flow. Second operand 22 states and 2653 transitions. [2022-01-19 07:44:44,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 2137 transitions, 33920 flow [2022-01-19 07:46:00,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 2137 transitions, 32447 flow, removed 563 selfloop flow, removed 19 redundant places. [2022-01-19 07:46:00,831 INFO L242 Difference]: Finished difference. Result has 417 places, 1903 transitions, 25217 flow [2022-01-19 07:46:00,832 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=22866, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=25217, PETRI_PLACES=417, PETRI_TRANSITIONS=1903} [2022-01-19 07:46:00,833 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 237 predicate places. [2022-01-19 07:46:00,833 INFO L470 AbstractCegarLoop]: Abstraction has has 417 places, 1903 transitions, 25217 flow [2022-01-19 07:46:00,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 116.70833333333333) internal successors, (2801), 24 states have internal predecessors, (2801), 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-01-19 07:46:00,833 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:46:00,833 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-19 07:46:00,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 07:46:01,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 07:46:01,046 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 07:46:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:46:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1608837302, now seen corresponding path program 2 times [2022-01-19 07:46:01,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:46:01,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377664219] [2022-01-19 07:46:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:46:01,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:46:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:46:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 07:46:01,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:46:01,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377664219] [2022-01-19 07:46:01,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377664219] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:46:01,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310293696] [2022-01-19 07:46:01,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:46:01,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:46:01,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:46:01,384 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 07:46:01,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 07:46:01,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 07:46:01,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:46:01,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-19 07:46:01,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:46:02,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:46:02,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:46:02,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:46:02,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-19 07:46:02,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-19 07:46:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:46:02,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:46:02,487 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_578 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-01-19 07:46:02,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-01-19 07:46:02,534 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))) is different from false [2022-01-19 07:46:02,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-01-19 07:46:04,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)))))) is different from false [2022-01-19 07:46:06,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) is different from false [2022-01-19 07:46:07,005 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:46:07,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 217 [2022-01-19 07:46:07,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 201 treesize of output 185 [2022-01-19 07:46:07,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 185 treesize of output 177 [2022-01-19 07:46:07,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 177 treesize of output 169 [2022-01-19 07:46:07,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 169 treesize of output 165 [2022-01-19 07:46:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-19 07:46:07,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310293696] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:46:07,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:46:07,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 26] total 59 [2022-01-19 07:46:07,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35340549] [2022-01-19 07:46:07,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:46:07,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-19 07:46:07,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:46:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-19 07:46:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2517, Unknown=6, NotChecked=642, Total=3422 [2022-01-19 07:46:07,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 207 [2022-01-19 07:46:07,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1903 transitions, 25217 flow. Second operand has 59 states, 59 states have (on average 104.67796610169492) internal successors, (6176), 59 states have internal predecessors, (6176), 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-01-19 07:46:07,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:46:07,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 207 [2022-01-19 07:46:07,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:46:10,463 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~i_7~0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= c_~s_6~0 0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~i_7~0 1) (= c_~X_0~0.offset 0) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* 4 c_~i_7~0))) c_~t_8~0)) is different from false [2022-01-19 07:46:12,499 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~i_7~0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= c_~s_6~0 0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= c_~s_6~0 c_~s_2~0) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (< c_~s_2~0 (+ c_~s_6~0 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~i_7~0 1) (= c_~X_0~0.offset 0) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* 4 c_~i_7~0))) c_~t_8~0)) is different from false [2022-01-19 07:46:14,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* 4 c_~i_7~0))))) (and (<= 1 c_~i_7~0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse0 c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)))))) (<= c_~s_6~0 .cse0) (<= c_~i_7~0 1) (= c_~X_0~0.offset 0))) is different from false [2022-01-19 07:46:16,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (= (+ c_~s_6~0 (* (- 1) (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) 0) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|)) is different from false [2022-01-19 07:46:18,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~X_0~0.base) 4))) (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)))))) (<= c_~s_6~0 .cse0) (<= .cse0 c_~s_6~0) (= c_~X_0~0.offset 0))) is different from false [2022-01-19 07:46:20,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 4))) (and (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= c_~s_6~0 .cse0) (= (+ c_~s_6~0 (* (- 1) (select .cse1 (+ c_~X_0~0.offset 4)))) 0) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork3_~#t2~0.base|)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= .cse0 c_~s_6~0) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0)))) is different from false [2022-01-19 07:46:22,920 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~i_7~0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~s_6~0 0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~i_7~0 1) (= c_~X_0~0.offset 0) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* 4 c_~i_7~0))) c_~t_8~0)) is different from false [2022-01-19 07:46:25,073 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_~i_7~0) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork3_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork3_~#t3~0.base_37|)) (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork3_~#t2~0.base_37| v_ArrVal_577) |v_thread1Thread1of1ForFork3_~#t3~0.base_37| v_ArrVal_578) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))))) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~s_6~0 0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= c_~s_6~0 c_~s_2~0) (< c_~s_2~0 (+ c_~s_6~0 1)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= c_~i_7~0 1) (= c_~X_0~0.offset 0) (= (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* 4 c_~i_7~0))) c_~t_8~0)) is different from false