./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack_longest-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:23:38,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:23:38,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:23:38,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:23:38,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:23:38,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:23:38,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:23:38,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:23:38,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:23:38,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:23:38,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:23:38,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:23:38,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:23:38,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:23:38,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:23:38,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:23:38,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:23:38,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:23:38,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:23:38,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:23:38,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:23:38,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:23:38,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:23:38,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:23:38,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:23:38,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:23:38,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:23:38,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:23:38,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:23:38,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:23:38,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:23:38,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:23:38,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:23:38,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:23:38,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:23:38,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:23:38,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:23:38,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:23:38,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:23:38,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:23:38,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:23:38,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:23:38,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-11-09 02:23:38,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:23:38,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:23:38,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:23:38,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:23:38,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:23:38,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-09 02:23:39,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:23:40,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:23:40,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2024-11-09 02:23:40,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71992ec68/a014de5e5f764406982324a036d8c57a/FLAG53700b43a [2024-11-09 02:23:40,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71992ec68/a014de5e5f764406982324a036d8c57a [2024-11-09 02:23:40,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:23:40,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:23:40,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:23:40,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:23:40,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:23:40,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556d64e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40, skipping insertion in model container [2024-11-09 02:23:40,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:23:40,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2024-11-09 02:23:40,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:23:40,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:23:40,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i[41530,41543] [2024-11-09 02:23:40,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:23:40,792 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:23:40,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40 WrapperNode [2024-11-09 02:23:40,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:23:40,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:23:40,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:23:40,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:23:40,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,902 INFO L138 Inliner]: procedures = 277, calls = 831, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 952 [2024-11-09 02:23:40,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:23:40,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:23:40,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:23:40,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:23:40,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,961 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 5, 802]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 5, 800]. The 1 writes are split as follows [0, 0, 1]. [2024-11-09 02:23:40,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:40,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:41,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:41,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:23:41,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:23:41,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:23:41,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:23:41,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (1/1) ... [2024-11-09 02:23:41,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:23:41,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:23:41,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:23:41,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:23:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 02:23:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 02:23:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 02:23:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 02:23:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 02:23:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:23:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:23:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:23:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:23:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 02:23:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:23:41,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:23:41,086 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:23:41,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:23:41,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:23:42,207 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:23:42,208 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:23:54,290 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:23:54,290 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:23:54,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:54 BoogieIcfgContainer [2024-11-09 02:23:54,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:23:54,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:23:54,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:23:54,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:23:54,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:23:40" (1/3) ... [2024-11-09 02:23:54,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2842665d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:23:54, skipping insertion in model container [2024-11-09 02:23:54,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:23:40" (2/3) ... [2024-11-09 02:23:54,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2842665d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:23:54, skipping insertion in model container [2024-11-09 02:23:54,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:54" (3/3) ... [2024-11-09 02:23:54,302 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-11-09 02:23:54,320 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:23:54,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 02:23:54,320 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:23:54,393 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 02:23:54,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2024-11-09 02:23:54,472 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2024-11-09 02:23:54,473 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 02:23:54,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2024-11-09 02:23:54,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2024-11-09 02:23:54,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2024-11-09 02:23:54,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:23:54,498 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c71aa3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:23:54,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 02:23:54,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:23:54,526 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-11-09 02:23:54,526 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 02:23:54,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:54,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:54,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:23:54,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1299057765, now seen corresponding path program 1 times [2024-11-09 02:23:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110370831] [2024-11-09 02:23:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110370831] [2024-11-09 02:23:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110370831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:23:55,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:23:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:23:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175615550] [2024-11-09 02:23:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:23:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:23:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:23:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:23:55,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-11-09 02:23:55,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:55,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:55,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-11-09 02:23:55,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:23:55,544 INFO L124 PetriNetUnfolderBase]: 342/656 cut-off events. [2024-11-09 02:23:55,544 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-09 02:23:55,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 656 events. 342/656 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3004 event pairs, 75 based on Foata normal form. 44/653 useless extension candidates. Maximal degree in co-relation 1176. Up to 358 conditions per place. [2024-11-09 02:23:55,554 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-11-09 02:23:55,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 228 flow [2024-11-09 02:23:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:23:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:23:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-09 02:23:55,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-11-09 02:23:55,569 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 71 flow. Second operand 4 states and 90 transitions. [2024-11-09 02:23:55,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 228 flow [2024-11-09 02:23:55,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 02:23:55,575 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 82 flow [2024-11-09 02:23:55,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-11-09 02:23:55,584 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2024-11-09 02:23:55,585 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 82 flow [2024-11-09 02:23:55,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:55,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:55,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:55,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:23:55,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:23:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -323793947, now seen corresponding path program 1 times [2024-11-09 02:23:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746352309] [2024-11-09 02:23:55,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:55,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746352309] [2024-11-09 02:23:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746352309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:23:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:23:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:23:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130039065] [2024-11-09 02:23:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:23:55,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:23:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:23:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:23:55,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-11-09 02:23:55,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:55,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:55,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-11-09 02:23:55,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:23:56,104 INFO L124 PetriNetUnfolderBase]: 341/640 cut-off events. [2024-11-09 02:23:56,105 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-09 02:23:56,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 640 events. 341/640 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2798 event pairs, 128 based on Foata normal form. 10/609 useless extension candidates. Maximal degree in co-relation 989. Up to 398 conditions per place. [2024-11-09 02:23:56,109 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-11-09 02:23:56,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2024-11-09 02:23:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:23:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:23:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-11-09 02:23:56,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-11-09 02:23:56,112 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 82 flow. Second operand 3 states and 62 transitions. [2024-11-09 02:23:56,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2024-11-09 02:23:56,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:23:56,114 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 92 flow [2024-11-09 02:23:56,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-11-09 02:23:56,116 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-11-09 02:23:56,116 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 92 flow [2024-11-09 02:23:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:56,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:56,116 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:23:56,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:23:56,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1286725888, now seen corresponding path program 1 times [2024-11-09 02:23:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:56,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715625013] [2024-11-09 02:23:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715625013] [2024-11-09 02:23:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715625013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:23:56,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692789777] [2024-11-09 02:23:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:56,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:23:56,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:23:56,567 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) [2024-11-09 02:23:56,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:23:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:56,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 1721 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 02:23:56,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:23:56,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 02:23:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:57,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:23:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692789777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:23:57,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:23:57,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-09 02:23:57,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323008957] [2024-11-09 02:23:57,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:23:57,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:23:57,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:23:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:23:57,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-11-09 02:23:57,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 92 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:57,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:57,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-11-09 02:23:57,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:23:57,683 INFO L124 PetriNetUnfolderBase]: 1030/1973 cut-off events. [2024-11-09 02:23:57,683 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-09 02:23:57,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4118 conditions, 1973 events. 1030/1973 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 10170 event pairs, 79 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 3563. Up to 390 conditions per place. [2024-11-09 02:23:57,696 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 137 selfloop transitions, 18 changer transitions 2/165 dead transitions. [2024-11-09 02:23:57,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 165 transitions, 729 flow [2024-11-09 02:23:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:23:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 02:23:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 269 transitions. [2024-11-09 02:23:57,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2024-11-09 02:23:57,702 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 92 flow. Second operand 12 states and 269 transitions. [2024-11-09 02:23:57,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 165 transitions, 729 flow [2024-11-09 02:23:57,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 165 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:23:57,707 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 237 flow [2024-11-09 02:23:57,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=237, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-11-09 02:23:57,708 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2024-11-09 02:23:57,709 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 237 flow [2024-11-09 02:23:57,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:57,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:57,709 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:57,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:23:57,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:23:57,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:23:57,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 402383298, now seen corresponding path program 1 times [2024-11-09 02:23:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296520285] [2024-11-09 02:23:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296520285] [2024-11-09 02:23:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296520285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:23:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:23:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:23:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653718156] [2024-11-09 02:23:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:23:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:23:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:23:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:23:58,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-11-09 02:23:58,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:58,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:58,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-11-09 02:23:58,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:23:58,435 INFO L124 PetriNetUnfolderBase]: 593/1233 cut-off events. [2024-11-09 02:23:58,435 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2024-11-09 02:23:58,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1233 events. 593/1233 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5827 event pairs, 204 based on Foata normal form. 60/1278 useless extension candidates. Maximal degree in co-relation 2654. Up to 580 conditions per place. [2024-11-09 02:23:58,442 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-09 02:23:58,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 309 flow [2024-11-09 02:23:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:23:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:23:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-11-09 02:23:58,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-11-09 02:23:58,444 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 237 flow. Second operand 3 states and 61 transitions. [2024-11-09 02:23:58,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 309 flow [2024-11-09 02:23:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 285 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-09 02:23:58,449 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 178 flow [2024-11-09 02:23:58,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-11-09 02:23:58,450 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-11-09 02:23:58,450 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 178 flow [2024-11-09 02:23:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:58,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:23:58,451 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:23:58,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:23:58,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:23:58,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:23:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1005035829, now seen corresponding path program 1 times [2024-11-09 02:23:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:23:58,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872560078] [2024-11-09 02:23:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:23:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:23:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:23:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:23:59,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:23:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872560078] [2024-11-09 02:23:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872560078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:23:59,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:23:59,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:23:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795223243] [2024-11-09 02:23:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:23:59,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:23:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:23:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:23:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:23:59,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-11-09 02:23:59,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:23:59,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:23:59,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-11-09 02:23:59,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:00,047 INFO L124 PetriNetUnfolderBase]: 653/1346 cut-off events. [2024-11-09 02:24:00,047 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2024-11-09 02:24:00,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3122 conditions, 1346 events. 653/1346 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6574 event pairs, 145 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2726. Up to 840 conditions per place. [2024-11-09 02:24:00,057 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 60 selfloop transitions, 5 changer transitions 2/75 dead transitions. [2024-11-09 02:24:00,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 402 flow [2024-11-09 02:24:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:24:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:24:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-11-09 02:24:00,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2024-11-09 02:24:00,058 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 178 flow. Second operand 5 states and 101 transitions. [2024-11-09 02:24:00,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 402 flow [2024-11-09 02:24:00,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:24:00,062 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 210 flow [2024-11-09 02:24:00,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-11-09 02:24:00,063 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-11-09 02:24:00,064 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 210 flow [2024-11-09 02:24:00,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:24:00,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:00,064 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:24:00,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:24:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1374442484, now seen corresponding path program 1 times [2024-11-09 02:24:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065538719] [2024-11-09 02:24:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:24:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065538719] [2024-11-09 02:24:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065538719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:24:01,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573924673] [2024-11-09 02:24:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:24:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:24:01,620 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) [2024-11-09 02:24:01,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:24:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:24:01,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 02:24:01,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:24:01,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 02:24:02,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 02:24:02,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-09 02:24:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:02,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:24:02,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-11-09 02:24:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 02:24:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573924673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:24:02,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:24:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-09 02:24:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600842728] [2024-11-09 02:24:02,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:24:02,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:24:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:24:02,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:24:02,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:24:02,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-11-09 02:24:02,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 210 flow. Second operand has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:24:02,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:24:02,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-11-09 02:24:02,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:24:03,630 INFO L124 PetriNetUnfolderBase]: 1212/2509 cut-off events. [2024-11-09 02:24:03,630 INFO L125 PetriNetUnfolderBase]: For 1204/1204 co-relation queries the response was YES. [2024-11-09 02:24:03,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5750 conditions, 2509 events. 1212/2509 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13701 event pairs, 231 based on Foata normal form. 0/2477 useless extension candidates. Maximal degree in co-relation 4658. Up to 384 conditions per place. [2024-11-09 02:24:03,649 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 136 selfloop transitions, 27 changer transitions 0/171 dead transitions. [2024-11-09 02:24:03,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 171 transitions, 952 flow [2024-11-09 02:24:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:24:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 02:24:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2024-11-09 02:24:03,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.611904761904762 [2024-11-09 02:24:03,652 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 210 flow. Second operand 12 states and 257 transitions. [2024-11-09 02:24:03,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 171 transitions, 952 flow [2024-11-09 02:24:03,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 171 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 02:24:03,659 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 376 flow [2024-11-09 02:24:03,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=376, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-11-09 02:24:03,660 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2024-11-09 02:24:03,660 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 376 flow [2024-11-09 02:24:03,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.6) internal successors, (189), 15 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:24:03,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:24:03,660 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:03,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:24:03,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 02:24:03,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-09 02:24:03,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:24:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 747430186, now seen corresponding path program 1 times [2024-11-09 02:24:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:24:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303219595] [2024-11-09 02:24:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:24:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:24:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:04,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:24:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:24:04,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:24:04,192 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:24:04,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-09 02:24:04,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-11-09 02:24:04,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-09 02:24:04,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-11-09 02:24:04,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-09 02:24:04,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-09 02:24:04,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:24:04,203 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:24:04,284 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 02:24:04,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:24:04,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:24:04 BasicIcfg [2024-11-09 02:24:04,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:24:04,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:24:04,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:24:04,292 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:24:04,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:23:54" (3/4) ... [2024-11-09 02:24:04,294 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 02:24:04,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 02:24:04,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:24:04,352 INFO L158 Benchmark]: Toolchain (without parser) took 24244.53ms. Allocated memory was 180.4MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 119.3MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 886.9MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,352 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:24:04,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.62ms. Allocated memory is still 180.4MB. Free memory was 119.3MB in the beginning and 114.5MB in the end (delta: 4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.23ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 105.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,353 INFO L158 Benchmark]: Boogie Preprocessor took 102.43ms. Allocated memory is still 180.4MB. Free memory was 105.4MB in the beginning and 96.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,353 INFO L158 Benchmark]: RCFGBuilder took 13282.89ms. Allocated memory was 180.4MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 96.9MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 686.7MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,353 INFO L158 Benchmark]: TraceAbstraction took 9999.80ms. Allocated memory was 9.3GB in the beginning and 11.0GB in the end (delta: 1.7GB). Free memory was 8.8GB in the beginning and 10.1GB in the end (delta: -1.3GB). Peak memory consumption was 407.9MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,353 INFO L158 Benchmark]: Witness Printer took 59.30ms. Allocated memory is still 11.0GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 02:24:04,355 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.62ms. Allocated memory is still 180.4MB. Free memory was 119.3MB in the beginning and 114.5MB in the end (delta: 4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.23ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 105.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.43ms. Allocated memory is still 180.4MB. Free memory was 105.4MB in the beginning and 96.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 13282.89ms. Allocated memory was 180.4MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 96.9MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 686.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9999.80ms. Allocated memory was 9.3GB in the beginning and 11.0GB in the end (delta: 1.7GB). Free memory was 8.8GB in the beginning and 10.1GB in the end (delta: -1.3GB). Peak memory consumption was 407.9MB. Max. memory is 16.1GB. * Witness Printer took 59.30ms. Allocated memory is still 11.0GB. Free memory was 10.1GB in the beginning and 10.1GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-4, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-4, id2=-3, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1135 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 2 mSDtfsCounter, 1135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1621 SizeOfPredicates, 21 NumberOfNonLiveVariables, 3491 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 02:24:04,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE