/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.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 01:20:29,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 01:20:29,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 01:20:29,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 01:20:29,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 01:20:29,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 01:20:29,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 01:20:29,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 01:20:29,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 01:20:29,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 01:20:29,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 01:20:29,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 01:20:29,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 01:20:29,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 01:20:29,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 01:20:29,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 01:20:29,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 01:20:29,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 01:20:29,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 01:20:29,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 01:20:29,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 01:20:29,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 01:20:29,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 01:20:29,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 01:20:29,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 01:20:29,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 01:20:29,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 01:20:29,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 01:20:29,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 01:20:29,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 01:20:29,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 01:20:29,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 01:20:29,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 01:20:29,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 01:20:29,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 01:20:29,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 01:20:29,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 01:20:29,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 01:20:29,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 01:20:29,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 01:20:29,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 01:20:29,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 01:20:29,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 01:20:29,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 01:20:29,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 01:20:29,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 01:20:29,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 01:20:29,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 01:20:29,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 01:20:29,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 01:20:29,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 01:20:29,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 01:20:29,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 01:20:29,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 01:20:29,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 01:20:29,401 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 01:20:29,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 01:20:29,401 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 01:20:29,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 01:20:29,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 01:20:29,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 01:20:29,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 01:20:29,586 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 01:20:29,587 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 01:20:29,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e00f77c/c4ce66679e6941a19ed47bb622f5bf39/FLAG4fba8cfa2 [2022-01-19 01:20:30,029 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 01:20:30,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-01-19 01:20:30,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e00f77c/c4ce66679e6941a19ed47bb622f5bf39/FLAG4fba8cfa2 [2022-01-19 01:20:30,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e00f77c/c4ce66679e6941a19ed47bb622f5bf39 [2022-01-19 01:20:30,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 01:20:30,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 01:20:30,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 01:20:30,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 01:20:30,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 01:20:30,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fffd7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30, skipping insertion in model container [2022-01-19 01:20:30,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 01:20:30,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 01:20:30,571 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 01:20:30,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 01:20:30,590 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 01:20:30,618 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 01:20:30,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 01:20:30,630 INFO L208 MainTranslator]: Completed translation [2022-01-19 01:20:30,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30 WrapperNode [2022-01-19 01:20:30,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 01:20:30,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 01:20:30,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 01:20:30,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 01:20:30,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,661 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-01-19 01:20:30,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 01:20:30,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 01:20:30,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 01:20:30,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 01:20:30,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 01:20:30,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 01:20:30,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 01:20:30,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 01:20:30,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (1/1) ... [2022-01-19 01:20:30,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 01:20:30,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:30,714 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 01:20:30,721 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 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 01:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 01:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 01:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 01:20:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 01:20:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 01:20:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 01:20:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 01:20:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 01:20:30,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 01:20:30,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 01:20:30,744 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 01:20:30,810 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 01:20:30,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 01:20:31,099 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 01:20:31,185 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 01:20:31,186 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 01:20:31,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:20:31 BoogieIcfgContainer [2022-01-19 01:20:31,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 01:20:31,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 01:20:31,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 01:20:31,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 01:20:31,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:20:30" (1/3) ... [2022-01-19 01:20:31,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec39f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:20:31, skipping insertion in model container [2022-01-19 01:20:31,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:20:30" (2/3) ... [2022-01-19 01:20:31,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec39f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:20:31, skipping insertion in model container [2022-01-19 01:20:31,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:20:31" (3/3) ... [2022-01-19 01:20:31,193 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-01-19 01:20:31,196 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 01:20:31,196 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 01:20:31,196 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 01:20:31,242 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,243 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,244 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,245 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,246 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,247 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,248 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,249 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,250 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,251 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,252 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,253 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,254 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,255 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,255 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,255 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,255 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,255 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,256 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,256 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,256 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,256 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,258 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 01:20:31,258 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 01:20:31,258 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 01:20:31,258 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 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,259 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,260 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,260 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,260 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,260 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 01:20:31,260 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,260 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 01:20:31,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,261 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 01:20:31,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,261 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 01:20:31,261 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 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 01:20:31,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,262 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 01:20:31,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,263 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 01:20:31,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,263 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,264 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,264 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 01:20:31,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,265 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,266 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 01:20:31,266 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 01:20:31,266 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 01:20:31,266 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 01:20:31,266 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,267 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,268 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 01:20:31,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,268 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 01:20:31,268 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,268 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 01:20:31,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,269 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 01:20:31,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,269 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 01:20:31,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,269 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,270 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,270 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,270 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,270 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 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 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 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,271 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 01:20:31,272 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,273 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,274 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 01:20:31,274 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 01:20:31,274 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 01:20:31,274 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 01:20:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,276 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 01:20:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,276 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 01:20:31,277 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 01:20:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,277 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 01:20:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,277 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 01:20:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,278 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 01:20:31,279 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 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 01:20:31,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,280 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 01:20:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,286 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 01:20:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,287 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,287 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,287 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 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 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 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,289 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 01:20:31,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,290 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,291 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 01:20:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,291 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 01:20:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,292 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,293 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,297 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,298 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,299 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,302 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 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 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,311 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 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 01:20:31,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,312 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 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 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 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,313 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,314 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:20:31,318 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-01-19 01:20:31,370 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 01:20:31,374 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 01:20:31,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 01:20:31,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 205 transitions, 454 flow [2022-01-19 01:20:31,479 INFO L129 PetriNetUnfolder]: 14/190 cut-off events. [2022-01-19 01:20:31,479 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 01:20:31,484 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 01:20:31,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 205 transitions, 454 flow [2022-01-19 01:20:31,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 392 flow [2022-01-19 01:20:31,528 INFO L129 PetriNetUnfolder]: 14/180 cut-off events. [2022-01-19 01:20:31,528 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 01:20:31,528 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:31,529 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 01:20:31,530 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 01:20:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1446293919, now seen corresponding path program 1 times [2022-01-19 01:20:31,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:31,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586747508] [2022-01-19 01:20:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:31,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:31,830 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 01:20:31,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586747508] [2022-01-19 01:20:31,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586747508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:20:31,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:20:31,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 01:20:31,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010240450] [2022-01-19 01:20:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:31,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 01:20:31,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 01:20:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 01:20:31,894 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 207 [2022-01-19 01:20:31,901 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 01:20:31,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:31,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 207 [2022-01-19 01:20:31,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:32,078 INFO L129 PetriNetUnfolder]: 191/594 cut-off events. [2022-01-19 01:20:32,078 INFO L130 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-01-19 01:20:32,082 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 01:20:32,085 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 21 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2022-01-19 01:20:32,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 173 transitions, 418 flow [2022-01-19 01:20:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 01:20:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 01:20:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 375 transitions. [2022-01-19 01:20:32,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2022-01-19 01:20:32,099 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 375 transitions. [2022-01-19 01:20:32,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 375 transitions. [2022-01-19 01:20:32,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:32,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 375 transitions. [2022-01-19 01:20:32,106 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 01:20:32,111 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 01:20:32,112 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 01:20:32,113 INFO L186 Difference]: Start difference. First operand has 180 places, 181 transitions, 392 flow. Second operand 2 states and 375 transitions. [2022-01-19 01:20:32,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 173 transitions, 418 flow [2022-01-19 01:20:32,116 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 01:20:32,119 INFO L242 Difference]: Finished difference. Result has 173 places, 169 transitions, 348 flow [2022-01-19 01:20:32,120 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 01:20:32,124 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, -7 predicate places. [2022-01-19 01:20:32,124 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 348 flow [2022-01-19 01:20:32,124 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 01:20:32,124 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:32,125 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 01:20:32,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 01:20:32,125 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 01:20:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2127134419, now seen corresponding path program 1 times [2022-01-19 01:20:32,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:32,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863840548] [2022-01-19 01:20:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:32,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:32,370 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 01:20:32,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863840548] [2022-01-19 01:20:32,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863840548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:20:32,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:20:32,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 01:20:32,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977972117] [2022-01-19 01:20:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:32,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 01:20:32,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:32,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 01:20:32,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 01:20:32,378 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 207 [2022-01-19 01:20:32,379 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 01:20:32,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:32,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 207 [2022-01-19 01:20:32,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:32,648 INFO L129 PetriNetUnfolder]: 481/1385 cut-off events. [2022-01-19 01:20:32,648 INFO L130 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-01-19 01:20:32,651 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 01:20:32,658 INFO L132 encePairwiseOnDemand]: 196/207 looper letters, 69 selfloop transitions, 10 changer transitions 4/211 dead transitions. [2022-01-19 01:20:32,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 211 transitions, 614 flow [2022-01-19 01:20:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 01:20:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 01:20:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2022-01-19 01:20:32,661 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7874396135265701 [2022-01-19 01:20:32,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2022-01-19 01:20:32,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2022-01-19 01:20:32,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:32,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2022-01-19 01:20:32,702 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 01:20:32,705 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 01:20:32,705 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 01:20:32,705 INFO L186 Difference]: Start difference. First operand has 173 places, 169 transitions, 348 flow. Second operand 6 states and 978 transitions. [2022-01-19 01:20:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 211 transitions, 614 flow [2022-01-19 01:20:32,707 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 01:20:32,710 INFO L242 Difference]: Finished difference. Result has 178 places, 175 transitions, 407 flow [2022-01-19 01:20:32,710 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 01:20:32,711 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, -2 predicate places. [2022-01-19 01:20:32,711 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 175 transitions, 407 flow [2022-01-19 01:20:32,712 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 01:20:32,712 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:32,712 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 01:20:32,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 01:20:32,712 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 01:20:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 283635425, now seen corresponding path program 1 times [2022-01-19 01:20:32,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:32,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419782481] [2022-01-19 01:20:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:32,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:32,868 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 01:20:32,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:32,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419782481] [2022-01-19 01:20:32,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419782481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:20:32,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:20:32,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 01:20:32,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023645745] [2022-01-19 01:20:32,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:32,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 01:20:32,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 01:20:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 01:20:32,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 207 [2022-01-19 01:20:32,873 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 01:20:32,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:32,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 207 [2022-01-19 01:20:32,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:33,192 INFO L129 PetriNetUnfolder]: 703/1924 cut-off events. [2022-01-19 01:20:33,192 INFO L130 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-01-19 01:20:33,198 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 01:20:33,205 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 75 selfloop transitions, 10 changer transitions 4/217 dead transitions. [2022-01-19 01:20:33,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 217 transitions, 712 flow [2022-01-19 01:20:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 01:20:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 01:20:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 978 transitions. [2022-01-19 01:20:33,208 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7874396135265701 [2022-01-19 01:20:33,208 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 978 transitions. [2022-01-19 01:20:33,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 978 transitions. [2022-01-19 01:20:33,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:33,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 978 transitions. [2022-01-19 01:20:33,210 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 01:20:33,211 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 01:20:33,212 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 01:20:33,212 INFO L186 Difference]: Start difference. First operand has 178 places, 175 transitions, 407 flow. Second operand 6 states and 978 transitions. [2022-01-19 01:20:33,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 217 transitions, 712 flow [2022-01-19 01:20:33,216 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 01:20:33,231 INFO L242 Difference]: Finished difference. Result has 183 places, 180 transitions, 473 flow [2022-01-19 01:20:33,231 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 01:20:33,232 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 3 predicate places. [2022-01-19 01:20:33,232 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 180 transitions, 473 flow [2022-01-19 01:20:33,233 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 01:20:33,233 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:33,233 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 01:20:33,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 01:20:33,234 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 01:20:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1054283516, now seen corresponding path program 1 times [2022-01-19 01:20:33,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433447854] [2022-01-19 01:20:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:33,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:33,328 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 01:20:33,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433447854] [2022-01-19 01:20:33,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433447854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:20:33,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:20:33,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 01:20:33,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224845856] [2022-01-19 01:20:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:33,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:20:33,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:20:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 01:20:33,331 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 207 [2022-01-19 01:20:33,332 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 01:20:33,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:33,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 207 [2022-01-19 01:20:33,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:33,787 INFO L129 PetriNetUnfolder]: 1018/2906 cut-off events. [2022-01-19 01:20:33,787 INFO L130 PetriNetUnfolder]: For 1384/1384 co-relation queries the response was YES. [2022-01-19 01:20:33,796 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 01:20:33,806 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 107 selfloop transitions, 8 changer transitions 0/246 dead transitions. [2022-01-19 01:20:33,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 246 transitions, 967 flow [2022-01-19 01:20:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 01:20:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 01:20:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1339 transitions. [2022-01-19 01:20:33,809 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8085748792270532 [2022-01-19 01:20:33,809 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1339 transitions. [2022-01-19 01:20:33,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1339 transitions. [2022-01-19 01:20:33,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:33,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1339 transitions. [2022-01-19 01:20:33,812 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 01:20:33,814 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 01:20:33,815 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 01:20:33,815 INFO L186 Difference]: Start difference. First operand has 183 places, 180 transitions, 473 flow. Second operand 8 states and 1339 transitions. [2022-01-19 01:20:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 246 transitions, 967 flow [2022-01-19 01:20:33,820 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 01:20:33,823 INFO L242 Difference]: Finished difference. Result has 190 places, 185 transitions, 529 flow [2022-01-19 01:20:33,824 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 01:20:33,824 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 10 predicate places. [2022-01-19 01:20:33,825 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 529 flow [2022-01-19 01:20:33,825 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 01:20:33,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:33,825 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 01:20:33,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 01:20:33,825 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 01:20:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1131479502, now seen corresponding path program 1 times [2022-01-19 01:20:33,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:33,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302551789] [2022-01-19 01:20:33,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:33,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:33,950 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 01:20:33,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302551789] [2022-01-19 01:20:33,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302551789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:20:33,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:20:33,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 01:20:33,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738485223] [2022-01-19 01:20:33,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:33,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:20:33,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:20:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 01:20:33,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 207 [2022-01-19 01:20:33,954 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 01:20:33,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:33,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 207 [2022-01-19 01:20:33,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:34,216 INFO L129 PetriNetUnfolder]: 780/2319 cut-off events. [2022-01-19 01:20:34,217 INFO L130 PetriNetUnfolder]: For 1480/1480 co-relation queries the response was YES. [2022-01-19 01:20:34,222 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 01:20:34,229 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 49 selfloop transitions, 4 changer transitions 20/204 dead transitions. [2022-01-19 01:20:34,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 204 transitions, 738 flow [2022-01-19 01:20:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 01:20:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 01:20:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1155 transitions. [2022-01-19 01:20:34,231 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2022-01-19 01:20:34,231 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1155 transitions. [2022-01-19 01:20:34,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1155 transitions. [2022-01-19 01:20:34,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:34,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1155 transitions. [2022-01-19 01:20:34,233 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 01:20:34,235 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 01:20:34,235 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 01:20:34,235 INFO L186 Difference]: Start difference. First operand has 190 places, 185 transitions, 529 flow. Second operand 7 states and 1155 transitions. [2022-01-19 01:20:34,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 204 transitions, 738 flow [2022-01-19 01:20:34,238 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 01:20:34,239 INFO L242 Difference]: Finished difference. Result has 196 places, 181 transitions, 508 flow [2022-01-19 01:20:34,240 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 01:20:34,240 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2022-01-19 01:20:34,240 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 181 transitions, 508 flow [2022-01-19 01:20:34,241 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 01:20:34,241 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:34,241 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 01:20:34,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 01:20:34,241 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 01:20:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:34,241 INFO L85 PathProgramCache]: Analyzing trace with hash -587263874, now seen corresponding path program 1 times [2022-01-19 01:20:34,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:34,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077122071] [2022-01-19 01:20:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:34,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:34,319 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 01:20:34,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:34,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077122071] [2022-01-19 01:20:34,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077122071] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:34,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351471556] [2022-01-19 01:20:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:34,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:34,321 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 01:20:34,327 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 01:20:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 01:20:34,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:34,734 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 01:20:34,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:35,032 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 01:20:35,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351471556] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:20:35,032 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:20:35,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 01:20:35,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165217649] [2022-01-19 01:20:35,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:20:35,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 01:20:35,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:35,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 01:20:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 01:20:35,036 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 01:20:35,038 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 01:20:35,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:35,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 01:20:35,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:35,541 INFO L129 PetriNetUnfolder]: 1018/2909 cut-off events. [2022-01-19 01:20:35,542 INFO L130 PetriNetUnfolder]: For 2212/2212 co-relation queries the response was YES. [2022-01-19 01:20:35,549 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 01:20:35,559 INFO L132 encePairwiseOnDemand]: 193/207 looper letters, 105 selfloop transitions, 16 changer transitions 0/251 dead transitions. [2022-01-19 01:20:35,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 251 transitions, 1053 flow [2022-01-19 01:20:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 01:20:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 01:20:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2267 transitions. [2022-01-19 01:20:35,563 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.782263630089717 [2022-01-19 01:20:35,563 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2267 transitions. [2022-01-19 01:20:35,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2267 transitions. [2022-01-19 01:20:35,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:35,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2267 transitions. [2022-01-19 01:20:35,566 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 01:20:35,569 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 01:20:35,570 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 01:20:35,570 INFO L186 Difference]: Start difference. First operand has 196 places, 181 transitions, 508 flow. Second operand 14 states and 2267 transitions. [2022-01-19 01:20:35,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 251 transitions, 1053 flow [2022-01-19 01:20:35,576 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 01:20:35,578 INFO L242 Difference]: Finished difference. Result has 202 places, 189 transitions, 581 flow [2022-01-19 01:20:35,578 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 01:20:35,578 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 22 predicate places. [2022-01-19 01:20:35,578 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 189 transitions, 581 flow [2022-01-19 01:20:35,579 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 01:20:35,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:35,579 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 01:20:35,598 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 01:20:35,799 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 01:20:35,800 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 01:20:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2110527098, now seen corresponding path program 1 times [2022-01-19 01:20:35,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:35,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090048605] [2022-01-19 01:20:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:35,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:35,911 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 01:20:35,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090048605] [2022-01-19 01:20:35,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090048605] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:35,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709539231] [2022-01-19 01:20:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:35,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:35,913 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 01:20:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 01:20:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:36,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 01:20:36,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:36,316 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 01:20:36,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:36,630 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 01:20:36,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709539231] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:20:36,630 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:20:36,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 01:20:36,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148137249] [2022-01-19 01:20:36,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:20:36,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 01:20:36,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:36,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 01:20:36,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 01:20:36,633 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 01:20:36,635 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 01:20:36,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:36,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 01:20:36,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:37,062 INFO L129 PetriNetUnfolder]: 723/2424 cut-off events. [2022-01-19 01:20:37,063 INFO L130 PetriNetUnfolder]: For 1759/1759 co-relation queries the response was YES. [2022-01-19 01:20:37,068 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 01:20:37,073 INFO L132 encePairwiseOnDemand]: 191/207 looper letters, 65 selfloop transitions, 14 changer transitions 20/229 dead transitions. [2022-01-19 01:20:37,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 229 transitions, 966 flow [2022-01-19 01:20:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 01:20:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 01:20:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2251 transitions. [2022-01-19 01:20:37,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7767425810904072 [2022-01-19 01:20:37,077 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2251 transitions. [2022-01-19 01:20:37,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2251 transitions. [2022-01-19 01:20:37,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:37,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2251 transitions. [2022-01-19 01:20:37,080 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 01:20:37,083 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 01:20:37,084 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 01:20:37,084 INFO L186 Difference]: Start difference. First operand has 202 places, 189 transitions, 581 flow. Second operand 14 states and 2251 transitions. [2022-01-19 01:20:37,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 229 transitions, 966 flow [2022-01-19 01:20:37,086 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 01:20:37,088 INFO L242 Difference]: Finished difference. Result has 214 places, 187 transitions, 586 flow [2022-01-19 01:20:37,089 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 01:20:37,089 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 34 predicate places. [2022-01-19 01:20:37,089 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 187 transitions, 586 flow [2022-01-19 01:20:37,090 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 01:20:37,090 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:37,090 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 01:20:37,119 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 01:20:37,305 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 01:20:37,305 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 01:20:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 211300924, now seen corresponding path program 2 times [2022-01-19 01:20:37,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:37,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308104760] [2022-01-19 01:20:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:37,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:37,408 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 01:20:37,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308104760] [2022-01-19 01:20:37,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308104760] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:37,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520813203] [2022-01-19 01:20:37,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 01:20:37,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:37,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:37,410 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 01:20:37,411 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 01:20:37,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 01:20:37,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:20:37,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 01:20:37,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:37,845 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 01:20:37,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:38,183 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 01:20:38,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520813203] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:38,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 01:20:38,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-01-19 01:20:38,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102353209] [2022-01-19 01:20:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:38,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 01:20:38,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 01:20:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-19 01:20:38,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 01:20:38,187 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 01:20:38,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:38,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 01:20:38,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:38,430 INFO L129 PetriNetUnfolder]: 493/1507 cut-off events. [2022-01-19 01:20:38,430 INFO L130 PetriNetUnfolder]: For 1816/1816 co-relation queries the response was YES. [2022-01-19 01:20:38,434 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 01:20:38,439 INFO L132 encePairwiseOnDemand]: 195/207 looper letters, 58 selfloop transitions, 11 changer transitions 0/199 dead transitions. [2022-01-19 01:20:38,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 199 transitions, 793 flow [2022-01-19 01:20:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 01:20:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 01:20:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1605 transitions. [2022-01-19 01:20:38,441 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7753623188405797 [2022-01-19 01:20:38,441 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1605 transitions. [2022-01-19 01:20:38,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1605 transitions. [2022-01-19 01:20:38,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:38,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1605 transitions. [2022-01-19 01:20:38,444 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 01:20:38,446 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 01:20:38,446 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 01:20:38,446 INFO L186 Difference]: Start difference. First operand has 214 places, 187 transitions, 586 flow. Second operand 10 states and 1605 transitions. [2022-01-19 01:20:38,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 199 transitions, 793 flow [2022-01-19 01:20:38,450 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 01:20:38,452 INFO L242 Difference]: Finished difference. Result has 207 places, 190 transitions, 595 flow [2022-01-19 01:20:38,452 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 01:20:38,452 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 27 predicate places. [2022-01-19 01:20:38,452 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 190 transitions, 595 flow [2022-01-19 01:20:38,453 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 01:20:38,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:38,453 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 01:20:38,471 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 01:20:38,669 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 01:20:38,669 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 01:20:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1954702868, now seen corresponding path program 2 times [2022-01-19 01:20:38,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:38,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594838553] [2022-01-19 01:20:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:38,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:38,748 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 01:20:38,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594838553] [2022-01-19 01:20:38,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594838553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:38,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037949821] [2022-01-19 01:20:38,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 01:20:38,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:38,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:38,750 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 01:20:38,751 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 01:20:38,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 01:20:38,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:20:38,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 01:20:38,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:39,145 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 01:20:39,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:39,451 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 01:20:39,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037949821] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:39,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 01:20:39,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-01-19 01:20:39,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208513624] [2022-01-19 01:20:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:20:39,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 01:20:39,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 01:20:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-19 01:20:39,453 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 207 [2022-01-19 01:20:39,463 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 01:20:39,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:39,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 207 [2022-01-19 01:20:39,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:39,748 INFO L129 PetriNetUnfolder]: 419/1263 cut-off events. [2022-01-19 01:20:39,748 INFO L130 PetriNetUnfolder]: For 1224/1224 co-relation queries the response was YES. [2022-01-19 01:20:39,752 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 01:20:39,756 INFO L132 encePairwiseOnDemand]: 197/207 looper letters, 74 selfloop transitions, 10 changer transitions 0/214 dead transitions. [2022-01-19 01:20:39,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 214 transitions, 886 flow [2022-01-19 01:20:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 01:20:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 01:20:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1611 transitions. [2022-01-19 01:20:39,759 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7782608695652173 [2022-01-19 01:20:39,759 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1611 transitions. [2022-01-19 01:20:39,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1611 transitions. [2022-01-19 01:20:39,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:39,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1611 transitions. [2022-01-19 01:20:39,762 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 01:20:39,764 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 01:20:39,764 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 01:20:39,765 INFO L186 Difference]: Start difference. First operand has 207 places, 190 transitions, 595 flow. Second operand 10 states and 1611 transitions. [2022-01-19 01:20:39,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 214 transitions, 886 flow [2022-01-19 01:20:39,767 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 01:20:39,769 INFO L242 Difference]: Finished difference. Result has 210 places, 191 transitions, 600 flow [2022-01-19 01:20:39,769 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 01:20:39,770 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 30 predicate places. [2022-01-19 01:20:39,770 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 191 transitions, 600 flow [2022-01-19 01:20:39,770 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 01:20:39,770 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:39,771 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 01:20:39,791 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 01:20:39,987 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 01:20:39,988 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 01:20:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1058627067, now seen corresponding path program 1 times [2022-01-19 01:20:39,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:39,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59142153] [2022-01-19 01:20:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:39,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:40,260 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 01:20:40,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:40,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59142153] [2022-01-19 01:20:40,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59142153] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:40,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993156088] [2022-01-19 01:20:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:40,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:40,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:40,264 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 01:20:40,265 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 01:20:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:40,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-19 01:20:40,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:40,669 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 01:20:40,796 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 01:20:40,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:41,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:20:41,006 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 01:20:41,163 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 01:20:41,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993156088] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:20:41,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:20:41,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 24 [2022-01-19 01:20:41,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036895698] [2022-01-19 01:20:41,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:20:41,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 01:20:41,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 01:20:41,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2022-01-19 01:20:41,166 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 207 [2022-01-19 01:20:41,168 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 01:20:41,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:41,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 207 [2022-01-19 01:20:41,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:43,603 INFO L129 PetriNetUnfolder]: 5301/10734 cut-off events. [2022-01-19 01:20:43,604 INFO L130 PetriNetUnfolder]: For 12113/12113 co-relation queries the response was YES. [2022-01-19 01:20:43,653 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 01:20:43,750 INFO L132 encePairwiseOnDemand]: 183/207 looper letters, 281 selfloop transitions, 81 changer transitions 8/462 dead transitions. [2022-01-19 01:20:43,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 462 transitions, 2487 flow [2022-01-19 01:20:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 01:20:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 01:20:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3799 transitions. [2022-01-19 01:20:43,758 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5920211937042231 [2022-01-19 01:20:43,758 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3799 transitions. [2022-01-19 01:20:43,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3799 transitions. [2022-01-19 01:20:43,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:43,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3799 transitions. [2022-01-19 01:20:43,765 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 01:20:44,024 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 01:20:44,025 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 01:20:44,025 INFO L186 Difference]: Start difference. First operand has 210 places, 191 transitions, 600 flow. Second operand 31 states and 3799 transitions. [2022-01-19 01:20:44,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 462 transitions, 2487 flow [2022-01-19 01:20:44,206 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 01:20:44,218 INFO L242 Difference]: Finished difference. Result has 248 places, 260 transitions, 1259 flow [2022-01-19 01:20:44,219 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 01:20:44,228 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 68 predicate places. [2022-01-19 01:20:44,228 INFO L470 AbstractCegarLoop]: Abstraction has has 248 places, 260 transitions, 1259 flow [2022-01-19 01:20:44,229 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 01:20:44,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:44,229 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 01:20:44,248 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 01:20:44,445 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 01:20:44,446 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 01:20:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 756627477, now seen corresponding path program 2 times [2022-01-19 01:20:44,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:44,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611067924] [2022-01-19 01:20:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:44,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:44,906 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 01:20:44,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:44,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611067924] [2022-01-19 01:20:44,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611067924] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:44,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605972381] [2022-01-19 01:20:44,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 01:20:44,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:44,909 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 01:20:44,910 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 01:20:45,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 01:20:45,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:20:45,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-19 01:20:45,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:45,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:20:45,384 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 01:20:45,456 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 01:20:45,609 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 01:20:45,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:45,811 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 01:20:45,833 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 01:20:45,841 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:20:45,841 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 01:20:45,843 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 01:20:46,173 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 01:20:46,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605972381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:20:46,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:20:46,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 38 [2022-01-19 01:20:46,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996093955] [2022-01-19 01:20:46,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:20:46,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-19 01:20:46,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:46,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-19 01:20:46,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1152, Unknown=2, NotChecked=138, Total=1406 [2022-01-19 01:20:46,180 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2022-01-19 01:20:46,182 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 01:20:46,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:46,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2022-01-19 01:20:46,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:52,454 INFO L129 PetriNetUnfolder]: 16199/30595 cut-off events. [2022-01-19 01:20:52,454 INFO L130 PetriNetUnfolder]: For 95795/95903 co-relation queries the response was YES. [2022-01-19 01:20:52,581 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 01:20:52,721 INFO L132 encePairwiseOnDemand]: 177/207 looper letters, 467 selfloop transitions, 410 changer transitions 4/978 dead transitions. [2022-01-19 01:20:52,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 978 transitions, 8090 flow [2022-01-19 01:20:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-19 01:20:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-01-19 01:20:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 6439 transitions. [2022-01-19 01:20:52,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5869109470422021 [2022-01-19 01:20:52,729 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 6439 transitions. [2022-01-19 01:20:52,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 6439 transitions. [2022-01-19 01:20:52,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:20:52,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 6439 transitions. [2022-01-19 01:20:52,739 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 01:20:52,748 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 01:20:52,749 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 01:20:52,749 INFO L186 Difference]: Start difference. First operand has 248 places, 260 transitions, 1259 flow. Second operand 53 states and 6439 transitions. [2022-01-19 01:20:52,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 978 transitions, 8090 flow [2022-01-19 01:20:53,200 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 01:20:53,208 INFO L242 Difference]: Finished difference. Result has 321 places, 715 transitions, 6569 flow [2022-01-19 01:20:53,208 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 01:20:53,223 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 141 predicate places. [2022-01-19 01:20:53,223 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 715 transitions, 6569 flow [2022-01-19 01:20:53,224 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 01:20:53,224 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:20:53,224 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 01:20:53,242 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 01:20:53,440 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 01:20:53,440 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 01:20:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:20:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1614840025, now seen corresponding path program 3 times [2022-01-19 01:20:53,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:20:53,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738098666] [2022-01-19 01:20:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:20:53,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:20:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:20:53,811 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 01:20:53,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:20:53,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738098666] [2022-01-19 01:20:53,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738098666] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:20:53,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146127184] [2022-01-19 01:20:53,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 01:20:53,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:20:53,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:20:53,820 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 01:20:53,834 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 01:20:53,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 01:20:53,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:20:53,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-19 01:20:53,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:20:54,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:20:54,434 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 01:20:54,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:20:54,509 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 01:20:54,583 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 01:20:54,682 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 01:20:54,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:20:54,802 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 01:20:54,853 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 01:20:54,901 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 01:20:54,917 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 01:20:54,998 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 01:20:55,009 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:20:55,009 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 01:20:55,012 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 01:20:55,015 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 01:20:55,018 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 01:20:55,021 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 01:20:55,371 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 01:20:55,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146127184] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:20:55,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:20:55,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 46 [2022-01-19 01:20:55,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224338569] [2022-01-19 01:20:55,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:20:55,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-19 01:20:55,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:20:55,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-19 01:20:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1497, Unknown=5, NotChecked=410, Total=2070 [2022-01-19 01:20:55,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 207 [2022-01-19 01:20:55,377 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 01:20:55,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:20:55,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 207 [2022-01-19 01:20:55,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:20:57,869 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 01:20:59,894 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 01:21:01,899 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 01:21:04,066 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 01:21:19,885 INFO L129 PetriNetUnfolder]: 36332/71090 cut-off events. [2022-01-19 01:21:19,885 INFO L130 PetriNetUnfolder]: For 1445044/1446633 co-relation queries the response was YES. [2022-01-19 01:21:20,962 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 01:21:21,431 INFO L132 encePairwiseOnDemand]: 170/207 looper letters, 1514 selfloop transitions, 539 changer transitions 9/2154 dead transitions. [2022-01-19 01:21:21,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 2154 transitions, 26370 flow [2022-01-19 01:21:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 01:21:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 01:21:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3453 transitions. [2022-01-19 01:21:21,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5560386473429951 [2022-01-19 01:21:21,444 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3453 transitions. [2022-01-19 01:21:21,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3453 transitions. [2022-01-19 01:21:21,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:21:21,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3453 transitions. [2022-01-19 01:21:21,463 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 01:21:21,468 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 01:21:21,469 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 01:21:21,469 INFO L186 Difference]: Start difference. First operand has 321 places, 715 transitions, 6569 flow. Second operand 30 states and 3453 transitions. [2022-01-19 01:21:21,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 2154 transitions, 26370 flow [2022-01-19 01:21:37,117 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 01:21:37,137 INFO L242 Difference]: Finished difference. Result has 359 places, 1200 transitions, 13289 flow [2022-01-19 01:21:37,138 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 01:21:37,139 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 179 predicate places. [2022-01-19 01:21:37,139 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 1200 transitions, 13289 flow [2022-01-19 01:21:37,140 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 01:21:37,140 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:21:37,140 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 01:21:37,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 01:21:37,356 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 01:21:37,357 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 01:21:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:21:37,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1264713485, now seen corresponding path program 4 times [2022-01-19 01:21:37,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:21:37,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519752333] [2022-01-19 01:21:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:21:37,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:21:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:21:37,653 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 01:21:37,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:21:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519752333] [2022-01-19 01:21:37,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519752333] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:21:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160175353] [2022-01-19 01:21:37,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 01:21:37,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:21:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:21:37,654 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 01:21:37,655 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 01:21:37,772 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 01:21:37,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:21:37,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-19 01:21:37,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:21:38,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:21:38,141 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 01:21:38,257 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 01:21:38,340 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 01:21:38,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:21:38,515 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 01:21:38,533 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 01:21:38,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:21:38,539 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 01:21:38,542 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 01:21:38,801 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 01:21:38,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160175353] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:21:38,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:21:38,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 41 [2022-01-19 01:21:38,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845421218] [2022-01-19 01:21:38,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:21:38,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 01:21:38,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:21:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 01:21:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1358, Unknown=2, NotChecked=150, Total=1640 [2022-01-19 01:21:38,805 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 207 [2022-01-19 01:21:38,807 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 01:21:38,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:21:38,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 207 [2022-01-19 01:21:38,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:22:15,437 INFO L129 PetriNetUnfolder]: 62548/123605 cut-off events. [2022-01-19 01:22:15,437 INFO L130 PetriNetUnfolder]: For 3549336/3552684 co-relation queries the response was YES. [2022-01-19 01:22:17,706 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 01:22:18,745 INFO L132 encePairwiseOnDemand]: 174/207 looper letters, 1527 selfloop transitions, 989 changer transitions 21/2634 dead transitions. [2022-01-19 01:22:18,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 2634 transitions, 41277 flow [2022-01-19 01:22:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 01:22:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 01:22:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4801 transitions. [2022-01-19 01:22:18,765 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5656887003652645 [2022-01-19 01:22:18,765 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4801 transitions. [2022-01-19 01:22:18,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4801 transitions. [2022-01-19 01:22:18,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:22:18,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4801 transitions. [2022-01-19 01:22:18,784 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 01:22:18,790 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 01:22:18,790 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 01:22:18,791 INFO L186 Difference]: Start difference. First operand has 359 places, 1200 transitions, 13289 flow. Second operand 41 states and 4801 transitions. [2022-01-19 01:22:18,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 2634 transitions, 41277 flow [2022-01-19 01:23:37,146 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 01:23:37,171 INFO L242 Difference]: Finished difference. Result has 409 places, 1789 transitions, 23977 flow [2022-01-19 01:23:37,172 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 01:23:37,172 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 229 predicate places. [2022-01-19 01:23:37,172 INFO L470 AbstractCegarLoop]: Abstraction has has 409 places, 1789 transitions, 23977 flow [2022-01-19 01:23:37,173 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 01:23:37,173 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:23:37,173 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 01:23:37,191 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 01:23:37,389 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 01:23:37,389 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 01:23:37,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:23:37,389 INFO L85 PathProgramCache]: Analyzing trace with hash -777772728, now seen corresponding path program 1 times [2022-01-19 01:23:37,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:23:37,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216608067] [2022-01-19 01:23:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:23:37,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:23:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:23:37,579 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 01:23:37,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:23:37,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216608067] [2022-01-19 01:23:37,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216608067] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:23:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427176492] [2022-01-19 01:23:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:23:37,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:23:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:23:37,581 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 01:23:37,582 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 01:23:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:23:37,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-19 01:23:37,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:23:38,058 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 01:23:38,156 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 01:23:38,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:23:38,280 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:23:38,280 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 01:23:38,287 INFO L353 Elim1Store]: treesize reduction 14, result has 22.2 percent of original size [2022-01-19 01:23:38,288 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 01:23:38,386 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 01:23:38,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427176492] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:23:38,386 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:23:38,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 10] total 24 [2022-01-19 01:23:38,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939159964] [2022-01-19 01:23:38,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:23:38,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 01:23:38,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:23:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 01:23:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2022-01-19 01:23:38,388 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 207 [2022-01-19 01:23:38,389 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 01:23:38,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:23:38,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 207 [2022-01-19 01:23:38,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:24:28,597 INFO L129 PetriNetUnfolder]: 67482/135489 cut-off events. [2022-01-19 01:24:28,600 INFO L130 PetriNetUnfolder]: For 4303190/4306720 co-relation queries the response was YES. [2022-01-19 01:24:32,458 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 01:24:33,541 INFO L132 encePairwiseOnDemand]: 183/207 looper letters, 1844 selfloop transitions, 173 changer transitions 6/2137 dead transitions. [2022-01-19 01:24:33,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 2137 transitions, 33920 flow [2022-01-19 01:24:33,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 01:24:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 01:24:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2653 transitions. [2022-01-19 01:24:33,545 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5825647782169522 [2022-01-19 01:24:33,545 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2653 transitions. [2022-01-19 01:24:33,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2653 transitions. [2022-01-19 01:24:33,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:24:33,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2653 transitions. [2022-01-19 01:24:33,548 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 01:24:33,551 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 01:24:33,551 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 01:24:33,552 INFO L186 Difference]: Start difference. First operand has 409 places, 1789 transitions, 23977 flow. Second operand 22 states and 2653 transitions. [2022-01-19 01:24:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 2137 transitions, 33920 flow [2022-01-19 01:25:57,990 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 01:25:58,020 INFO L242 Difference]: Finished difference. Result has 417 places, 1903 transitions, 25217 flow [2022-01-19 01:25:58,021 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 01:25:58,022 INFO L334 CegarLoopForPetriNet]: 180 programPoint places, 237 predicate places. [2022-01-19 01:25:58,022 INFO L470 AbstractCegarLoop]: Abstraction has has 417 places, 1903 transitions, 25217 flow [2022-01-19 01:25:58,022 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 01:25:58,022 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:25:58,022 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 01:25:58,041 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 01:25:58,238 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 01:25:58,239 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 01:25:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:25:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1608837302, now seen corresponding path program 2 times [2022-01-19 01:25:58,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:25:58,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664102346] [2022-01-19 01:25:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:25:58,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:25:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:25:58,552 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 01:25:58,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:25:58,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664102346] [2022-01-19 01:25:58,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664102346] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:25:58,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35912854] [2022-01-19 01:25:58,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 01:25:58,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:25:58,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:25:58,556 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 01:25:58,558 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 01:25:58,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 01:25:58,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:25:58,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-19 01:25:58,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:25:59,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:25:59,220 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 01:25:59,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:25:59,288 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 01:25:59,359 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 01:25:59,484 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 01:25:59,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:25:59,656 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 01:25:59,683 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 01:25:59,735 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 01:25:59,754 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 01:26:01,839 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 01:26:04,280 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 01:26:04,291 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:26:04,291 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 01:26:04,297 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 01:26:04,300 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 01:26:04,303 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 01:26:04,321 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 01:26:04,844 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 01:26:04,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35912854] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:26:04,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:26:04,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 26] total 59 [2022-01-19 01:26:04,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410060754] [2022-01-19 01:26:04,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:26:04,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-19 01:26:04,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:26:04,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-19 01:26:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2517, Unknown=6, NotChecked=642, Total=3422 [2022-01-19 01:26:04,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 207 [2022-01-19 01:26:04,853 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 01:26:04,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:26:04,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 207 [2022-01-19 01:26:04,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:26:07,605 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 01:26:09,641 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 01:26:11,648 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 01:27:09,951 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 01:29:52,292 WARN L228 SmtUtils]: Spent 28.04s on a formula simplification. DAG size of input: 44 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 01:30:00,541 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 01:30:04,792 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